#include <fstream>
#include <vector>
#include <cstring>
using namespace std;

ifstream is("strmatch.in");
ofstream os("strmatch.out");

int N, M;
char A[2000001], B[2000001];
int PI[2000001];
int k;
vector <int> Sol;

int main()
{
    is >> A+1 >> B+1;
    N = strlen(A+1);
    M = strlen(B+1);
    k = 0;
    for ( int i = 2; i <= N; ++i )
    {
        while ( k > 0 && A[k+1] != A[i] )
            k = PI[k];

        if ( A[k+1] == A[i] )
            k++;

        PI[i] = k;
    }

    k = 0;
    for ( int i = 1; i <= M; ++i )
    {
        while ( k > 0 && A[k+1] != B[i] )
            k = PI[k];

        if ( A[k+1] == B[i] )
            k++;

        if ( k == N )
            Sol.push_back(i-N);

    }
    int cnt = min(1000,(int)Sol.size());

    os << cnt << '\n';
    for ( int i = 0; i < cnt; ++i )
        os << Sol[i] << " ";

    is.close();
    os.close();
}