/* 
 * File:   main.cpp
 * Author: SpeeDemon
 *
 * Created on April 4, 2010, 6:33 PM
 */
#include <string>
#include <vector>
#include <cstdlib>
#include <fstream>
#include <iterator>
#define Alpha 73
#define Modulo 10000013

/*
 *
 */
using namespace std;
vector< int > v;
string pattern, ss;
inline int uint_mod( int a )
{
    return ( a%Modulo + Modulo )%Modulo;
}
inline int min( int x, int y )
{
    if( x > y )
        return y;
    return x;
}
inline void Rabin_Karp( int PatternSize, int StringSize )
{
    if( PatternSize > StringSize )
        return;
    bool ok=true;
    int i, j, k, hss, hp, E;
    for( E=1, hss=hp=i=0; i < PatternSize; ++i )
    {
        hp=uint_mod( hp*Alpha+pattern[i] );
        hss=uint_mod( hss*Alpha+ss[i] );
       if( i < PatternSize-1 )
           E=(1LL*Alpha*E)%Modulo;
        if( pattern[i] != ss[i] )
            ok=false;
    }
    if( ok )
        v.push_back(0);
    for( ; i < StringSize; ++i )
    {
        hss=uint_mod( hss - uint_mod( ss[i-PatternSize]*E ) );
        hss=uint_mod( hss*Alpha + ss[i] );
        if( hp == hss )
        {
            for( j=PatternSize-1, k=i; j >= 0; --j, --k )
                if( pattern[j] != ss[k] )
                    break;
            if( j < 0 )
                v.push_back(k+1);
        }
    }
}
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, " ") );
    out<<'\n';
    return EXIT_SUCCESS;
}