#include <bits/stdc++.h>
#define minim(a, b) ((a < b) ? a : b)
#define NMax 2000005
using namespace std;
int M, N;
char A[NMax], B[NMax];
int pi[NMax]{}, pos[1024];

void prefix(){
int i,q=0;
for(i=2;i<=M;++i){
if(q&&A[q+1]!=A[i]){
    q=pi[q];
}
if(A[q+1]==A[i]){
    ++q;
    pi[i]=q;
}

}
}
int main(){
ifstream fin ;
fin.open("strmatch.in");
ofstream fout ;
fout.open("strmatch.out");
fin>>A;
fin>>B;
M=strlen(A);
N=strlen(B);
int i;
for(i=M;i>0;i--){
    A[i]=A[i-1];
}
for(i=N;i>0;i--){
    B[i]=B[i-1];
}
A[i]=' ';
B[i]=' ';
prefix();
int q=0,n=0;
for(i=1;i<=N;++i){
    while(q&&A[q+1]!=B[i]){
        q=pi[q];
    }
    if(A[q+1]==B[i]){
        ++q;

    }
    if(q==M){
        ++n;
        q=pi[M];
        if(n<=1000){
            pos[n]=i-M;
        }
    }
}
fout<<n<<"\n";
for(i=1;i<=minim(n,1000);++i){
    fout<<pos[i]<<" ";
}
fin.close();
fout.close();


return 0;
}