#include <cstdio>
#include <cstring>
#include <string>
#include <cmath>
#include <iostream>
#include <algorithm>
#include <vector>
#include <stack>
#include <sstream>
#include <map>
#include <set>
#include <queue>
#include <stdlib.h>
typedef long long ll;
using namespace std;
int main ()
{
string a,b;
getline(cin,a);
getline(cin,b);
int len1=a.length();
int len2=b.length();
for(int i=0;i<len1;i++) a[i]=toupper(a[i]);
for (int i=0;i<len2;i++) b[i]=toupper(b[i]);
int flag;
int sum=0;
int panduan=0;
for (int i=0;i<len2;i++) //对查找字符串进行for循环
{
flag=1;
if( (i!=0 && b[i-1]!=' ') || b[i+len1]!=' ') continue; //如果当前i不是第一个字符,直接continue;
for (int j=0;j<len1;j++)
{
if( b[i+j] != a[j] )
{
flag=0;
break;
}
}
if(flag==1)
{
sum++;
if(sum==1) panduan=i;
}
}
if(sum!=0)cout << sum << " " << panduan << endl;
else cout << "-1" << endl;
}