#include <fstream>
#include<cstring>
using namespace std;
char N[2000001],M[2000001];
long long nr,v[1001],i,k,urm[2000001],q,n,m,nr1;
int main()
{
    ifstream fin ("strmatch.in");
    ofstream fout ("strmatch.out");
    fin>>N;
    fin>>M;
    n=strlen(N);
    m=strlen(M);
    urm[1]=0;
    k=0;
    for (i=2;i<=n;i++)
    {
        while (k>0&&N[k]!=N[i-1]) k=urm[k];
        if (N[k]==N[i-1]) k++;
        urm[i]=k;
    }
    q=0;
    for (i=0;i<=m;i++)
    {
        if (q>0&&N[q]!=M[i]) q=urm[q];
        if (N[q]==M[i]) q++;
        if (q==n) {nr++;if(nr<=1000)nr1++;v[nr1]=i-n+1;}
    }
    fout<<nr<<'\n';
    for (i=1;i<=nr1;i++)
        fout<<v[i]<<" ";
    return 0;
}