#include<fstream>
#include<cstring>
using namespace std;
int L, n,m, i, p[100007], nrsol, sol[1007], k;
char a[100007], b[100007];
ifstream in("strmatch.in");
ofstream out("strmatch.out");
int main(){
    in>>a+1;
    in>>b+1;
    n=strlen(a+1);
    m=strlen(b+1);
    //p[i]=lungimea maxima a unui sufix care este si prefix al secventei de la unu la i din a
    //p[i]<i
    p[1]=0;
    L=0;
    for(i=2; i<=n; i++){
        //calculam p[i]

        while (a[i]!=a[L+1] && L!=0){
            L=p[L];
        }
        if(a[i]==a[L+1])
            L++;

        p[i]=L;

    }

    // parcurgem sirul in care cautam iar la pasul curent i
    //L va reprezenta cel mai lung sufix din secventa B[1..i] care e prefix in A

    L = 0;
    for(i=1; i<=m; i++){
        while(b[i]!=a[L+1] && L!=0){
            L=p[L];
        }
        if(b[i]==a[L+1])
            L++;
        if(L==n){
            nrsol++;
            if(nrsol<=1000){
                sol[nrsol]=i-L;
                k++;
            }
        }

    }

    out<<nrsol<<"\n";
    for(i=1; i<=k; i++)
        out<<sol[i]<<" ";

/*
    for(i=1; i<=n; i++)
        out<<p[i]<<" ";
*/
    return 0;
}