#include<bits/stdc++.h>
using namespace std;
ifstream F("strmatch.in");
ofstream G("strmatch.out");
#define N 2000001
char s[N],u[N];
int v[1000],i,t,k,m,n,p[N];
int main()
{
    F>>s>>u,m=strlen(s),n=strlen(u);
    for(i=2;i<m;++i) {
        while(k&&s[k+1]!=s[i])
            k=p[k];
        if(s[k+1]==s[i])
            ++k;
        p[i]=k;
    }
    for(k=0,i=1;i<n;++i) {
        while(k&&s[k+1]!=u[i])
            k=p[k];
        if(s[k+1]==u[i])
            ++k;
        if(k==m-1&&s[0]==u[i-k]) {
            if(t<1000)
                v[t]=i-m+1;
            ++t;
        }
    }
    for(G<<t<<"\n",t=t>1000?1000:t,i=0;i<t;++i)
        G<<v[i]<<" ";
    return 0;
}