#include <fstream>
#include <cstring>

using namespace std;

ifstream fin("strmatch.in");
ofstream fout("strmatch.out");

char S[4000010];
int Z[4000010],i,j,n,m,p,q,k,l,r,ans[1001];

void expand()
{
    while( S[ r + 1 ] == S[ r - l + 1 ] && r + 1 < n )
        r++;
}

int main()
{
    fin.get( S , 2000010 );
    fin.get();
    k = strlen( S );
    Z[ 0 ] = k;
    S[ k ] = '$';
    fin.get( S + k + 1 , 2000010 );
    n = strlen( S );

    for( i = 1 ; i < n ; i++ )
    {
        Z[ i ] = 0;
        if( l <= i && i <= r )
        {
            if( Z[ i - l ] > i - r )
            {
                l = i;
                expand();
                Z[ i ] = r - l + 1;
            }
            else
                Z[ i ] = Z[ i - l ];
        }
        else
        {
            l = r = i;
            expand();
            Z[ i ] = r - l + 1;
        }
        if( Z[ i ] == k )
        {
            ++ans[ 0 ];
            if( ans[ 0 ] <= 1000 )
                ans[ ans[ 0 ] ] = i;
        }
    }

    fout<<ans[ 0 ]<<'\n';
    for( i = 1 ; i <= min( 1000 , ans[ 0 ] ) ; i++ )
        fout<<ans[ i ]-k-1<<' ';

return 0;
}