#include <stdio.h>
#include <cstring>
#include <vector>
#define nmax 2000010
using namespace std;
int n,m,i,j,k,urm[nmax],nr;
char s[nmax],ss[nmax];
vector <int> sol;
inline int min(int a,int b) { if (a<b) return a; else return b; }
int main() {
freopen("strmatch.in","r",stdin);
freopen("strmatch.out","w",stdout);
gets(ss+1); m=strlen(ss+1);
gets(s+1); n=strlen(s+1);
k=0; urm[1]=0;
for (i=2;i<=m;i++) {
    while (k>0 && ss[k+1]!=ss[i]) k=urm[k];
    if (ss[k+1]==ss[i]) k++;
    urm[i]=k;
}
k=0;
for (i=1;i<=n;i++) {
    while (k>0 && ss[k+1]!=s[i]) k=urm[k];
    if (ss[k+1]==s[i]) k++;
    if (k==m) {
        nr++; if (nr<=1000) sol.push_back(i-m); k=urm[k];
    }
}
printf("%d\n",sol.size());
for (i=0;i<min(nr,1000);i++) printf("%d ",sol[i]);
return 0;
}