#include <fstream>
#include <cstring>
#define NMAX 2000099
using namespace std;

ifstream f("strmatch.in");
ofstream g("strmatch.out");

int N, M, q, pref[NMAX], sol, v[1009];
char A[NMAX], B[NMAX];

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

void KMP()
{
    int q=0;
    for(int i=1; i<=M; i++)
    {
        while(q>=1 && A[q+1]!=B[i]) q=pref[q];
        if(A[q+1]==B[i]) q++;
        if(q==N && ++sol<=1000) v[sol]=i-N+1;
    }
}

int main()
{
    f>>(A+1)>>(B+1);
    N=strlen(A+1);
    M=strlen(B+1);
    make_prefix();
    KMP();
    g<<sol<<'\n';
    for (int i=1; i<=min(sol, 1000); i++) g<<v[i]-1<<' ';
    g<<'\n';
    f.close();g.close();
    return 0;
}