#include <bits/stdc++.h>

using namespace std;
ifstream in("strmatch.in");
ofstream out("strmatch.out");
const int nx=2000002;
char a[nx],b[nx];
int pre[nx];
vector < int > sol;
void calc_pref(char a[])
{
    int lg=strlen(a);
    int k=0;
    for(int i=1; i<lg; i++)
    {
        while(a[k]!=a[i] && k>0)
            k=pre[k-1];
        if(a[i]==a[k])
            k++;
        pre[i]=k;
    }
}
void kmp (char a[], char b[])
{
    int lga=strlen(a);
    int lgb=strlen(b);
    calc_pref(a);
    int k=0;
    for(int i=0; i<lgb; i++)
    {
        while(a[k]!=b[i] && k>0)
            k=pre[k-1];
        if(a[k]==b[i])
            k++;
        if(k==lga)
            sol.push_back(i-lga+1);
    }
}
int main()
{
    in>>a>>b;
    kmp(a,b);
    out<<sol.size()<<'\n';
    for(int i=0; i<min((unsigned)1000,sol.size()); i++)
        out<<sol[i]<<' ';
    return 0;
}