#include<cstring>
#include<cstdio>
#include<algorithm>
#include<vector>
using namespace std;
FILE *f=fopen("strmatch.in","r");
FILE *g=fopen("strmatch.out","w");
char s1[2000005],s2[2000005];
int sar[2000005],n1,n2,nr;
vector<int> sol;

void completeaza()
{
    for(int i=2;i<=n1;i++)
        if(s1[i-1]==s1[sar[i-1]])
            sar[i]=sar[i-1]+1;
        else if(s1[i-1]==s1[0]) sar[i]=1;
}
void kmp()
{
    int i,j,k=0,nrap=0;
    for(i=0;i<n2;)
    {
        j=0;k=i;
         while(j<n1&&s2[k]==s1[j]){k++;j++;}
        if(j==n1)sol.push_back(i);
        i=k-sar[j];
    }
    nr=sol.size();
    fprintf(g,"%d\n",nr);
    nrap=min(1000,nr);
    for(i=0;i<nrap;i++)
       fprintf(g,"%d ",sol[i]);

}
int main()
{

    sar[0]=-1;sar[1]=0;
    fscanf(f,"%s%s",&s1,&s2);
    n1=strlen(s1);
    n2=strlen(s2);
    completeaza();
    kmp();
    return 0;
}