#include <cstdio>
#include <cstring>
#include <algorithm>

#define Nmax 2000005

using namespace std;
char A[Nmax],B[Nmax];
int P[Nmax],N,M,ans[1005];

void read()
{
    scanf("%s%s",A+1,B+1);
    A[0] = '#';B[0] = '#';
    N = strlen(A)-1;
    M = strlen(B)-1;
}

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

void make_match()
{
    int q = 0;
    for(int i = 1; i <= M; ++i)
    {
        while(q && B[i] != A[q+1])
            q = P[q];
        if(B[i] == A[q+1])
            ++q;
        if(q == N)
        {
            q = P[q];
            if(++ans[0] <= 1000)
                ans[ans[0]] = i - N;
        }
    }
}
int main()
{
    freopen("strmatch.in","r",stdin);
    freopen("strmatch.out","w",stdout);

    read();
    make_prefix();
    make_match();
    printf("%d\n",ans[0]);
    for(int i = 1; i <= min(1000,ans[0]); ++i)
        printf("%d ",ans[i]);

    return 0;
}