#include<cstdio>
#include<cstring>
#include<vector>
#include<algorithm>
using namespace std;
int m,n,i,j,k,p[2000005];
vector<int>rez;
char A[2000005],B[2000005];

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

void kmp()
{
    k=0;
    for (i=1;i<=m;i++)
    {
        while (k && A[k+1]!=B[i]) k=p[k];
        if (A[k+1]==B[i]) k++;
        if (k==n) rez.push_back(i-n);
    }
}

int main()
{
    freopen("strmatch.in","r",stdin);
    freopen("strmatch.out","w",stdout);
    gets(A+1);
    gets(B+1);
    n=strlen(A+1);
    m=strlen(B+1);
    prefix();
    kmp();
    printf("%d\n",rez.size());
    k=rez.size();
    k=min(k,1000);
    for (i=0;i<k;i++) printf("%d ",rez[i]);
    return 0;
}