#include <iostream>
#include <vector>
#include <algorithm>
using namespace std;


int main(){
    string a;
    string target;
    cin>>target;
    //统一改为小写处理
    for(int i=0;i<target.size();i++){
        if(target[i] <= 'Z' && target[i] >= 'A'){
            target[i]+=32;
        }
    }
    int i=0,FirstAppearedPosition=-1,TimesOfApperance=0;
    while(cin>>a){
        //变为小写
        for(int i=0;i<a.size();i++){
            if(a[i] <= 'Z' && a[i] >= 'A'){
                a[i]+=32;
            }
        }
        //累加次数并记录第一次出现位置
        if(a==target){
            if(FirstAppearedPosition==-1) FirstAppearedPosition=i;
            TimesOfApperance++;
        }
        i++;
    }
    if(FirstAppearedPosition==-1) cout<<"-1";
    else cout<<TimesOfApperance<<" "<<FirstAppearedPosition;
    return 0;
}```