#include <iostream>
#include <fstream>
#include <cstring>
#include <vector>
using namespace std;
ifstream fin("strmatch.in");
ofstream fout("strmatch.out");
char a[2000001],b[2000001];
int pi[2000001],m,n,i;
vector<int> v;
void prefix()
{
    int i,k=0;
    for(i=2;i<=m;i++)
    {
        while(k&&a[k+1]!=a[i]) k=pi[k];
        if(a[k+1]==a[i]) k++;
        pi[i]=k;
    }
}
void kmp()
{
    int i,k=0;
    prefix();
    for(i=1;i<=n;i++)
    {
        while(k&&a[k+1]!=b[i]) k=pi[k];
        if(a[k+1]==b[i]) k++;
        if(k==m)
        {
            k=pi[m];
            if(v.size()<1000)
            v.push_back(i-m);
        }
    }
}
int main()
{
    fin>>a>>b;
    n=strlen(b); m=strlen(a);
    for(i=m;i>=1;i--) a[i]=a[i-1];
    for(i=n;i>=1;i--) b[i]=b[i-1];
    kmp();
    fout<<v.size()<<"\n";
    m=v.size();
    n=min(m,1000);
    for(i=0;i<m;i++)
        fout<<v[i]<<" ";
    return 0;
}