#include<cstdio>
#include<cstring>
#define N_MAX 2000000
#define L_MAX 1000
using namespace std;

char T[N_MAX+2], P[N_MAX+2];
int L[N_MAX+2], s[L_MAX+2], n, m, nr;

void Read()
{
    FILE *fin = fopen("strmatch.in","r");
    fscanf(fin,"%s",P);
    fscanf(fin,"%s",T);
    n = strlen(T);
    m = strlen(P);
    fclose(fin);
}

int minim(int x, int y)
{
    if(x < y) return x;
    return y;
}

void buildPrefix()
{
    int i, k;
    k = 0;
    for(i=1; i<m; i++)
    {
        while(k > 0 && P[k] != P[i])
            k = L[k-1];
        if(P[k] == P[i])
            k++;
        L[i] = k;
    }
}

void KMP()
{
    int i, k;
    k = 0;
    for(i=0; i<n; i++)
    {
        while(k > 0 && P[k] != T[i])
            k = L[k-1];
        if(P[k] == T[i])
            k++;
        if(k == m)
        {
            if(nr < L_MAX)
                s[nr++] = i-m+1;
            else nr++;
        }
    }
}

void Write()
{
    int l, i;
    FILE *fout = fopen("strmatch.out","w");
    fprintf(fout,"%d\n",nr);
    l = minim(nr,1000);
    for(i=0; i<l; i++)
        fprintf(fout,"%d ",s[i]);
    fprintf(fout,"\n");
    fclose(fout);
}

int main()
{
    Read();
    buildPrefix();
    KMP();
    Write();
    return 0;
}