/* 
 * File:   main.cpp
 * Author: bitone
 *
 * Created on October 13, 2010, 1:28 PM
 */
#include <string>
#include <vector>
#include <fstream>
#include <cstdlib>
#include <iterator>
#include <algorithm>
#define MAX_N 2000011

using namespace std;

/*
 * 
 */
int N, M;
int f[MAX_N];
vector< int > v;
string text, pattern;
inline void F( void )
{
    int 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;
    }
}
inline void KMP( void )
{
    F();
    for( int i=0, j=0; i < N; )
    {
        if( text[i] == pattern[j] )
        {
            ++i, ++j;
            if( M == j )
                v.push_back(i-M);
        }
        else if( j )
                j=f[j];
             else ++i;
    }
}
int main(int argc, char** argv)
{
    ifstream in( "strmatch.in" );
    getline( in, pattern );
    getline( in, text );
    N=text.size();
    M=pattern.size();
    KMP();
    ofstream out( "strmatch.out" );
    out<<(M=v.size())<<'\n';
    copy( v.begin(), v.begin()+( M <= 1000 ? M : 1000 ), ostream_iterator<int>( out, " " ) );
    out<<'\n';vector< int > v;
    return EXIT_SUCCESS;
}