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

/*
 *
 */
using namespace std;
vector< int > v;
char pattern[Nmax], ss[Nmax];
inline int uint_mod( int x, int y )
{
    return ( x%y + y )%y;
}
inline int min( int x, int y )
{
    if( x < y )
        return x;
    return y;
}
inline void Rabin_Karp( int PatternSize, int StringSize )
{
    if( PatternSize > StringSize )
        return;
    int i, E1, E2, hp, hp2, hss, hss2;
    for( E1=E2=1, hp=hp2=hss=hss2=i=0; i < PatternSize; ++i )
    {
        hp=uint_mod( hp*Alpha+pattern[i], Modulo );
        hp2=uint_mod( hp2*Alpha2+pattern[i], Modullo );
        hss=uint_mod( hss*Alpha+ss[i], Modulo );
        hss2=uint_mod( hss2*Alpha2+ss[i], Modullo );
        if( i+1 < PatternSize )
        {
            E1=(1LL*E1*Alpha)%Modulo;
            E2=(1LL*E2*Alpha2)%Modullo;
        }
    }
    if( hp == hss && hp2 == hss2 )
        v.push_back(0);
    for( ; i < StringSize; ++i )
    {
        hss=uint_mod( hss - uint_mod( ss[i-PatternSize]*E1, Modulo ), Modulo );
        hss2=uint_mod( hss2 - uint_mod( ss[i-PatternSize]*E2, Modullo ), Modullo );
        hss=uint_mod( hss*Alpha+ss[i] , Modulo );
        hss2=uint_mod( hss2*Alpha2+ss[i] , Modullo );
        if( hp == hss && hp2 == hss2 )
            v.push_back(i-PatternSize+1);
    }
}
int main( void )
{
    freopen( "strmatch.in", "rt", stdin );
    gets(pattern);
    gets(ss);
    Rabin_Karp( strlen(pattern), strlen(ss) );
    freopen( "strmatc.out", "wt", stdout );
    printf( "%d\n", v.size() );
    for( int i=0, N=min( v.size(), 1000 ); i < N; ++i )
        printf( "%d", v[i] );
    printf("\n");
    return EXIT_SUCCESS;
}