#include<iostream>
#include<cmath>
#include<algorithm>
#include<cstring>
using namespace std;

char p[1000000] = { 0 };
int main()
{
	char ch[12] = {0};
	cin >> ch;
	getchar();
	char c= getchar();
	int i = 0;
	
	while (c != EOF && !(c >= '0' && c <= '9' ))
	{
		if (c == '\n')
		{
			getchar();
			c = getchar();
		}
		else {
			p[i++] = c;
			c = getchar();
		}
	}
	p[i] = '\0';
	i = 0;
	int k = 0,count=0,first=-1;
	while (p[i] != '\0') 
	{
		k = 0;
		while (*(ch+k) != '\0' && p[i] != '\0')
	    {if (p[i] == *(ch + k) || p[i] + 32 == *(ch + k) || p[i] - 32 == *(ch + k))
			   {
			i++;  k++;
			   }
			else
			{
				k = 0;
				i++;
			}
	     }
		if (*(ch+k)=='\0' && p[i] != '\0')
		{
			count++;
			if(first==-1)
			first = i-k;
	}
	}
	if (count > 0)
		cout << count << endl << first;
	else
		cout << first;
	return 0;
}