#include <bits/stdc++.h>

using namespace std;

ifstream fin("strmatch.in");
ofstream fout("strmatch.out");

const int NMAX = 2000005;
char a[NMAX],b[NMAX];
int p[NMAX],rasp[1005],dim_rasp;

int main()
{
    fin >> (a+1);
    fin >> (b+1);
    int n=strlen(a+1),m=strlen(b+1);
    /// p[i] = cel mai lung sufix care e si prefix a secv [1,i] din sirul A
    /// [---x___---i_______]
    ///  lg     lg
    /// compar x cu i , x=a[lg+1], i=a[i]
    p[1]=0;
    for(int i=2;i<=n;i++){
        int lg=p[i-1];
        while(a[lg+1]!=a[i] and lg!=0){
            lg=p[lg];
        }
        if(a[lg+1]!=a[i]) p[i]=0;
        else              p[i]=lg+1;
    }
    int ind=0; /// unde ma aflu in A;
    for(int i=1;i<=m;i++){
        /// pozitia i ar trebuie sa-mi continuie sirul
        ind++;
        while(b[i]!=a[ind] and ind!=0){
            ind=p[ind];
        }
        if(ind==n){
            dim_rasp++;
            if(dim_rasp<=1000) rasp[dim_rasp]=i-n+1;
            ind=p[ind];
        }
    }
    fout << dim_rasp << '\n';
    for(int i=1;i<=min(dim_rasp,1000);i++)
        fout << rasp[i]-1 << ' ';
    return 0;
}