/* 
 * 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 2000011

/*
 * 
 */
using namespace std;
size_t F[Nmax];
string pattern, ss;
vector< size_t > match;
inline void Function( size_t M )
{
    size_t i, j;

    for( i=2; i <= M; ++i )
    {
        for( j=F[i-1]; j && pattern[j] != pattern[i-1] ; j=F[j] );
        if( pattern[j] == pattern[i-1] )
            ++j;
        F[i]=j;
    }
}
inline void PatternMatching( size_t N, size_t M )
{
    size_t i, j;
    Function( M );
    for( i=j=0; i < N ; )
    {
        if( ss[i] == pattern[j] )
        {
            ++i, ++j;
            if( M == j )
            {
                match.push_back( i-M );
            }
        }
        else if( j > 0 )
                j=F[j];
             else ++i;
    }
}
inline size_t min( size_t x, size_t y )
{
    if( x < y )
        return x;
    return y;
}
int main( void )
{
    ifstream in( "strmatch.in" );
    getline( in, pattern, '\n' );
    getline( in, ss );
    PatternMatching( ss.size(), pattern.size() );
    ofstream out( "strmatch.out" );
    out<<match.size()<<'\n';
    copy( match.begin(), match.begin()+min( 1000, match.size() ), ostream_iterator<int>( out, " " ) );
    out<<'\n';
    return EXIT_SUCCESS;
}