#include <string>
#include <vector>
#include <cstdlib>
#include <fstream>
#include <iterator>
#include <algorithm>
#define MAX_N 2000011

using namespace std;

/*
 *
 */
int F[MAX_N];
vector< int > v;
string txt, pattern;
void failure_function( void )
{
	int M=pattern.size(), i, j;
	for( i=2; i <= M; ++i )
	{
		for( j=F[i-1]; j && pattern[j] != pattern[i-1]; j=F[j] );
		if( pattern[i-1] == pattern[j] )
			++j;
		F[i]=j;
	}
}
void KMP( void )
{
	int N=txt.size(), M=pattern.size(), i, j;
	failure_function();
	pattern.push_back( ' ' );
	for( i=j=0; i < N; )
	{
		if( pattern[j] == txt[i] )
		{
			++i, ++j;
			if( M == j )
				v.push_back(i-M);
		}
		else if( j )
				j=F[j];
			 else ++i ;
	}
}
inline int min( int x, int y )
{
	return ( x <= y ? x : y );
}
int main( void )
{
	ifstream in( "strmatch.in" );
	getline( in, pattern );
	getline( in, txt );
	KMP();
	ofstream out( "strmatch.out" );
	out<<v.size()<<'\n';
	copy( v.begin(), v.begin()+min( v.size(), 1000 ), ostream_iterator<int>( out, " " ) );
	out<<'\n';
	return EXIT_SUCCESS;
}