#include <bits/stdc++.h>

using namespace std;
ifstream fin ("strmatch.in");
ofstream fout ("strmatch.out");
char s[2000005], t[2000005];
int pref[2000005], sol[2000005];
void prefix(int n)
{
    int i,k;
    pref[1]=0;
    k=0;
    for(i=2; i<=n; ++i)
    {
        while(s[i]!=s[k+1]&&k>0)k=pref[k];
        if(s[i]==s[k+1])++k;
        pref[i]=k;
    }
}
int x1,x2,i,k;
int main()
{
    fin>>(s+1)>>(t+1);
    x1=strlen(s+1);
    x2=strlen(t+1);
    prefix(x1);
    for(i=1; i<=x2; ++i)
    {
        while(t[i]!=s[k+1]&&k>0)k=pref[k];
        if(t[i]==s[k+1])++k;
        if(k>=x1)sol[++sol[0]]=i-x1;
    }
    fout<<sol[0]<<'\n';
    for(i=1; i<=min(sol[0],1000); ++i)fout<<sol[i]<<" ";
    return 0;
}