#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <algorithm>
using namespace std;

#define Nmax 2000010

char A[Nmax], B[Nmax];
int N, M, PI[Nmax], Ap[1010], Cnt;

void Build_Prefix()
{
    int i, P = 0;
    PI[1] = 0;
    for(i = 2; i <= N; ++i)
    {
        while(P && A[P + 1] != A[i]) P = PI[P];
        if(A[P + 1] == A[i]) P ++;
        PI[i] = P;
    }
}

void Search()
{
    int i, P = 0;
    for(i = 1; i <= M; ++i)
    {
        while(P && A[P + 1] != B[i]) P = PI[P];
        if(A[P + 1] == B[i]) P ++;
        if(P == N)
        {
            P = PI[P];
            Cnt ++;
            if(Cnt <= 1000) Ap[Cnt] = i - N;
        }
    }
}

int main()
{
    freopen("strmatch.in", "r", stdin);
    freopen("strmatch.out", "w", stdout);
    gets(A + 1); N = strlen(A + 1);
    gets(B + 1); M = strlen(B + 1);
    Build_Prefix();
    Search();
    printf("%i\n", Cnt);
    for(int i = 1; i <= min(Cnt, 1000); i++) printf("%i ", Ap[i]);
    return 0;
}