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