/// KMP

#include <stdio.h>
#include <string.h>

using namespace std;

const int nmax = 2000010;
char A[nmax], B[nmax], M, N;

void read()
{
    freopen ("strmatch.in","r",stdin);
    freopen ("strmatch.out","w",stdout);

    gets(A);
    gets(B);
    N = strlen(A);
    M = strlen(B);
    int i;
    for(i = N; i > 0; i--)
        A[i] = A[i - 1];
    for(i = M; i > 0; i--)
        B[i] = B[i - 1];
}

int pi[nmax], pos[1024];

void maquette()
{
    int i, q = 0;

    for(i = 2; i < N; i++)
    {
        while(q && A[q + 1] != A[i])
            q = pi[q];
        if(A[q + 1] == A[i])
            q++;
        pi[i] = q;
    }
}

void solve()
{
    int i, q = 0, tot = 0;

    for(i = 1; i < M; i++)
    {
        while(q && A[q + 1] != B[i])
            q = pi[q];
        if(A[q + 1] == B[i])
            q++;
        if(q == N - 1)
        {
            tot++;
            q = pi[q];
            if(tot <= 1000)
                pos[tot] = i - N + 1;
        }
    }
    printf("%d\n",tot);
    for(i = 1; i <= tot && i <= 1000; i++)
        printf("%d ",pos[i]);
    printf("\n");
}

int main()
{
    read();
    maquette();
    solve();
    return 0;
}