#include <bits/stdc++.h>
#define NMAX 2000005
using namespace std;

ifstream fin("strmatch.in");
ofstream fout("strmatch.out");
int urm[NMAX];
char A[NMAX], B[NMAX];
int n, m, c;
vector <int> sol(1005);

void make_prefix() {
    int k=0;
    urm[1]=0;
    for(int i=2; i<=n; i++) {
        while(k && A[k+1]!=A[i]) k=urm[k];
        if(A[k+1]==A[i]) k++;
        urm[i]=k;
    }
}

int main()
{
    int x=0;
    fin.getline(A+1, sizeof(A+1));
    fin.getline(B+1, sizeof(B+1));
    n=strlen(A+1); m=strlen(B+1);
    make_prefix();
    for(int i=1; i<=m; ++i) {
        while(x && A[x+1]!=B[i]) x=urm[x];
        if(A[x+1]==B[i]) ++x;
        if(x==n) {
            x=urm[n];
            ++c;
            if(c<=1000) sol[c]=i-n;
        }
    }
    fout<<c<<endl;
    for(int i=0; i<min(c,1000); i++)
        fout<<sol[i]<<' ';
    return 0;
}