#include <fstream>
#include <cstring>
using namespace std;
ifstream f ("strmatch.in");
ofstream g ("strmatch.out");
const int nmax=2e6+3;
char a[nmax],b[nmax];
int ant[nmax],n,m,q,sol[1003],k;
void make_prefix()
{
    int q=0;
    for(int i=2;i<=m;++i)
    {
        while(q&&a[q+1]!=a[i]) q=ant[q];
        if(a[q+1]==a[i]) ++q;
        ant[i]=q;
    }
}
int main()
{
    f>>(a+1);
    f>>(b+1);
    m=strlen(a+1);
    n=strlen(b+1);
    make_prefix();
    q=0;
    for(int i=1;i<=n;++i)
    {
        while(q&&a[q+1]!=b[i]) q=ant[q];
        if(a[q+1]==b[i]) ++q;
        if(q==m)
        {
            ++k;
            if(k<=1000) sol[k]=i-m;
            q=ant[q];
        }
    }
    g<<k<<'\n';
    for(int i=1;i<=min(k,1000);++i) g<<sol[i]<<' ';
    return 0;
}