/* 
 * File:   main.cpp
 * Author: virtualdemon
 *
 * Created on April 25, 2010, 9:41 AM
 */
#include <string>
#include <vector>
#include <cstdlib>
#include <fstream>
#include <iterator>
#define Nmax 2000001

/*
 * 
 */
using namespace std;
int F[Nmax];
string pattern, ss;
vector< size_t > match;
inline void FPrefix( size_t M )
{
    int i, k;
    for( k=-1, i=1; i < M; ++i )
    {
        for( ; k > 0 && pattern[k+1] != pattern[i]; k=F[k] );
        if( pattern[k+1] != pattern[i] )
            ++k;
        F[i]=k;
    }
}
inline void PatternMatch( size_t N, size_t M )
{
    int i, k;
    FPrefix( M );
    for( k=-1, M-=1, i=0; i < N; ++i )
    {
        for( ; k > 0 && pattern[k+1] != ss[i]; k=F[k] );
        if( pattern[k+1] == ss[i] )
            ++k;
        if( k == M )
            match.push_back( i-M );
    }
}
template< class T, class TT >
inline T min( T x, TT y )
{
    if( x < y )
        return x;
    return y;
}
int main( void )
{
    ifstream in( "strmatch.in" );
    in>>pattern>>ss;
    PatternMatch( ss.size(), pattern.size() );
    ofstream out( "strmatch.out" );
    out<<match.size()<<'\n';
    copy( match.begin(), match.begin()+min( 1000, match.size() ), ostream_iterator<size_t>( out, " " ) );
    out<<'\n';
    return EXIT_SUCCESS;
}