#include<bits/stdc++.h>
using namespace std;
ifstream f("strmatch.in");
ofstream g("strmatch.out");
int n,k,pi[2000001],m,q;
char N[2000001],M[2000001];
int sol[1002],s;
int main()
{
    f>>(N+1);
    f>>(M+1);
    n=strlen(N+1);
    m=strlen(M+1);
    for(int i=2;i<=n;++i){
        while(k && (N[k + 1] != N[i]))
            k=pi[k];
        if(N[k + 1]==N[i])
            ++k;
        pi[i]=k;
    }
    q=0;
    for(int i=1;i<=m;++i){
        while(q  && (N[q + 1] != M[i]))
            q=pi[q];
        if(N[q + 1] ==M[i])
            ++q;
        if(q==n)
        {
            ++s;
            if(s<=1000)
                sol[s]=i-n;
        }
    }
    g<<s<<'\n';
    for(int i=1;i<=min(s,1000);++i)
        g<<sol[i]<<" ";
    return 0;
}