#include<cstdio>
#include<cstring>
#define MAX_LEN 2000000
#define MAX_POS 1000
using namespace std;

char P[MAX_LEN + 1], T[MAX_LEN + 1];
int pos[MAX_POS], L[MAX_LEN + 1], n, m, nr;

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

int main()
{
    int q, i, k, l;
    FILE *fin, *fout;
    fin = fopen("strmatch.in","r");
    fout = fopen("strmatch.out","w");
    fscanf(fin,"%s%s",P,T);
    m = strlen(P);
    n = strlen(T);
    k = 0;
    for(q=1; q<m; q++)
    {
        while((k > 0) && (P[q] != P[k]))
            k = L[k-1];
        if(P[q] == P[k])
            k++;
        L[q] = k;
    }
    k = 0;
    for(i=0; i<n; i++)
    {
        while((k > 0) && (T[i] != P[k]))
            k = L[k-1];
        if(T[i] == P[k])
            k++;
        if(k == m)
        {
            if(nr < MAX_POS)
                pos[nr++] = i-m+1;
            else nr++;
        }
    }
    fprintf(fout,"%d\n",nr);
    l = minim(nr,MAX_POS);
    for(i=0; i<l; i++)
        fprintf(fout,"%d ",pos[i]);
    fprintf(fout,"\n");
    fclose(fin);
    fclose(fout);
    return 0;
}