#include<cstdio>
#include<iostream>
#include<algorithm>
#include<cstring>
#include<cmath>
#include<queue>
#include<map>
#include<vector>
#include<set> 
#define inf 0x7fffffff
#define ll long long
#define ull unsigned long long
#define fi first
#define se second
using namespace std;
int cnt,ans=-1,ans2;
int sum[500000];
string s;
string s1;
string g[500000];
int calc(char x)
{
	if(x<'Z')
	return x-'A';
	else
	return x-'a';
}
int main()
{
	freopen("stat.in","r",stdin);
	freopen("stat.out","w",stdout);
	cin>>s; 
	while(cin>>s1)g[++cnt]=s1,sum[cnt]=sum[cnt-1]+g[cnt].size();cnt--;
	for(int i=1;i<=cnt;i++)
	{
		bool flag=1;
		if(s.size()==g[i].size()){
			for(int j=0;j<s.size();j++){if(calc(s[j])!=calc(g[i][j])){flag=0;break;}}
			if(flag){ans2++;
				if(ans==-1)ans=sum[i]-g[i].size()+i-1;
			}
		}
	}
	if(ans2)printf("%d %d\n",ans2,ans);
	else printf("-1\n");
}