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

using namespace std;
int F[N_MAX];
vector< int > v;
string pattern, ss;
inline void BuiltFunction()
{
    int M=pattern.size(), i, j;
    for( i=2; i <= M; ++i )
    {
        for( j=F[i-1]; j && pattern[i-1] != pattern[j]; j=F[j] );
        if( pattern[i-1] == pattern[j] )
            ++j;
        F[i]=j;
    }
}
void KMP()
{
    BuiltFunction();
    int N=ss.size(), M=pattern.size(), i, j;
    pattern.push_back(' ');
    for( i=j=0; i < N; )
    {
        if( pattern[j] == ss[i] )
        {
            ++i, ++j;
            if( M == j )
                v.push_back(i-M);
        }
        else if( j )
                j=F[j];
             else ++i;
    }
}
inline int _min( int i, int j ) { return ( i <= j ? i : j ); }
int main( void )
{
    ifstream in( "strmatch.in" );
    getline( in, pattern );
    getline( in, ss );
    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;
}