/* 
 * File:   main.cpp
 * Author: SpeeDemon
 *
 * Created on April 5, 2010, 10:10 AM
 */
#include <string>
#include <vector>
#include <fstream>
#include <iterator>

/*
 *
 */
using namespace std;
vector< int > v, f;
string pattern, ss;
void build_function( int PatternSize )
{
    int i, j;
    f[0]=f[1]=0;
    for( i=2; i <= PatternSize; ++i )
    {
        j=f[i-1];
        for( ; ; j=f[j] )
        {
            if( pattern[j] == pattern[i-1] )
            {
                f[i]=j+1;
                break;
            }
            if( !j )
            {
                f[i]=0;
                break;
            }
        }
    }
}
inline void KMP( int PatternSize, int StringSize )
{
    if( PatternSize > StringSize )
        return;
    int i, j;
    build_function( PatternSize );
    for( i=j=0; j < StringSize ; )
    {
        if( ss[j] == pattern[i] )
        {
            ++i, ++j;
            if( i == PatternSize )
                v.push_back( j-PatternSize );
        }
        else if( i > 0 )
                i=f[i];
             else ++j;
    }
}
inline int min( int x, int y )
{
    if( x < y )
        return x;
    return y;
}
int main( void )
{
    ifstream in( "strmatch.in" );
    in>>pattern>>ss;
    f.resize( pattern.size()+1 );
    KMP( 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;
}