#include <vector>
#include <string>
#include <fstream>
#include <iterator>
#include <algorithm>
#define Alpha 67
#define ModuloA 32749
#define ModuloB 32719

using namespace std;
vector< int > v;
int main( )
{
	string s, pattern;
	int lsize, lpattern, i, patternHash1, patternHash2, sHash1, sHash2, nAlphaA=1, nAlphaB=1, match=0;
	ifstream in( "strmatch.in" );
	getline( in, pattern );
	getline( in, s );
	lsize=s.size();
	lpattern=pattern.size();
	for( i=patternHash1=patternHash2=sHash1=sHash2=0; i < lpattern; ++i )
	{
		patternHash1=( patternHash1*Alpha+pattern[i] )%ModuloA;
		patternHash2=( patternHash2*Alpha+pattern[i] )%ModuloB;
		sHash1=( sHash1*Alpha+s[i] )%ModuloA;
		sHash2=( sHash2*Alpha+s[i] )%ModuloB;
		nAlphaA=( nAlphaA*Alpha )%ModuloA;
		nAlphaB=( nAlphaB*Alpha )%ModuloB;
	}
	if( patternHash1 == sHash1 && patternHash2 == sHash2 )
		match=1, v.push_back(0);
	for( ; i < lsize; ++i )
	{
		sHash1=( sHash1*Alpha+ModuloA-(s[i-lpattern]*nAlphaA)%ModuloA+s[i] )%ModuloA;
		sHash2=( sHash2*Alpha+ModuloB-(s[i-lpattern]*nAlphaB)%ModuloB+s[i] )%ModuloB;
		if( patternHash1 == sHash1 && patternHash2 == sHash2 )
		{
			++match;
			if( match <= 1000 )
				v.push_back( i-lpattern+1 );
		}
	}
	ofstream out( "strmatch.out" );
	out<<match<<'\n';
	copy( v.begin(), v.end(), ostream_iterator<int>( out, " " ) );
	out<<'\n';
	return EXIT_SUCCESS;
}