#include <fstream>
#include <string.h>
using namespace std;
ifstream f("strmatch.in");
ofstream g("strmatch.out");
int lps[2000005],v[2000005],n,m;
char A[2000005],B[2000005];
void BuildLPS()
{
    int i,k=0;
    lps[1]=0;
    for (i=2;i<=n;i++)
    {
        while (k>0 && B[i-1]!=B[k]) k=lps[k];
        if (B[i-1]==B[k]) k++;
        lps[i]=k;
    }
}
void KMP()
{
    int k=0,q=0,i;
    for (i=0;i<m;i++)
    {
        while (q>0 && A[i]!=B[q]) q=lps[q];
        if (B[q]==A[i]) q++;
        if (q==n) v[++k]=i-n+1;
        if (k==1000) break;
    }
        g<<k<<'\n';
    for (i=1;i<=k;i++) g<<v[i]<<" ";
}
int main()
{
    f>>B;
    f>>A;
    n=strlen(B);
    m=strlen(A);
    BuildLPS();
    KMP();
    return 0;
}