/* 
 * File:   main.cpp
 * Author: VirtualDemon
 *
 * Created on April 4, 2010, 9:40 AM
 */
#include <string>
#include <vector>
#include <cstdlib>
#include <fstream>
#include <iterator>
#define Alpha 41
#define Alpha2 73
#define Modulo 1000033
#define Modullo 1000081

/*
 *
 */
using namespace std;
vector< int > v;
string pattern, ss;
inline void Rabin_Karp( int PatternSize, int StringSize )
{
    if( PatternSize > StringSize )
        return;
    int E1, E2, i, hp, hp2, hss, hss2;
    for( E1=E2=1, hp=hp2=hss=hss2=i=0; i < PatternSize; ++i )
    {
        hp=( hp*Alpha+pattern[i] )%Modulo;
        hp2=( hp2*Alpha2+pattern[i] )%Modullo;
        hss=( hss*Alpha+ss[i] )%Modulo;
        hss2=( hss2*Alpha2+ss[i] )%Modullo;
        if( i )
        {
            E1=(E1*Alpha)%Modulo;
            E2=(E2*Alpha2)%Modullo;
        }
    }
    if( hp == hss && hp2 == hss2 )
        v.push_back(0);
    for( ; i < StringSize; ++i )
    {
        hss=( ( ( hss - (ss[i-PatternSize]*E1)%Modulo + Modulo )%Modulo )*Alpha+ss[i])%Modulo;
        hss2=( ( ( hss2 - (ss[i-PatternSize]*E2)%Modullo + Modullo )%Modullo )*Alpha2+ss[i])%Modullo;
        if( hp == hss && hp2 == hss2 )
            v.push_back(i-PatternSize+1);
    }
}
inline int min( int x, int y )
{
    if( x > y )
        return y;
    return x;
}
int main( void )
{
    ifstream in( "strmatch.in" );
    in>>pattern>>ss;
    Rabin_Karp( pattern.size(), ss.size() );
    ofstream out( "strmatch.out" );
    out<<v.size()<<'\n';
    copy( v.begin(), v.begin()+min( v.size(), 1000 ), ostream_iterator<int>( out, " " ) );
    return EXIT_SUCCESS;
}