/* 
 * File:   main.cpp
 * Author: SpeeDemon
 *
 * Created on April 4, 2010, 6:33 PM
 */
#include <cstring>
#include <vector>
#include <cstdlib>
#include <cstdio>
//#include <iterator>
#define Alpha 41
#define Nmax 2000010
#define Modulo 1000033


/*
 *
 */
using namespace std;
vector< int > v;
char pattern[Nmax], ss[Nmax];
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=( hss*Alpha + ss[i] )%Modulo;
        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 )
{
    freopen( "strmatch.in", "rt", stdin );
    gets( pattern ); gets( ss );
    Rabin_Karp( strlen(pattern), strlen(ss) );
    freopen( "strmatch.out", "wt", stdout );
    printf( "%d\n", v.size() );
    for( int i=0, N=min( v.size(), 1001 ); i < N; ++i )
        printf( "%d ", v[i] );
    //printf("\n");
    return EXIT_SUCCESS;
}