#include <bits/stdc++.h>
using namespace std;
int n,m;
char A[2000001],B[2000001];
int pi[20000001];
void prefix(){
    int q=0;
    for(int i=2;i<=n;++i){
        while(q>0&&A[q+1]!=A[i])
            q=pi[q];
        if(A[q+1]==A[i])
            ++q;
        pi[i]=q;
    }
}
void KMP(){
    int q=0,sol[1005],ct_sol=0;
    for(int i=1;i<=m;++i){
        while(q>0&&A[q+1]!=B[i])
            q=pi[q];
        if(A[q+1]==B[i])
            ++q;
        if(q==n){
            ++ct_sol;
            if(ct_sol<=1000)
                sol[ct_sol]=i-n;
            q=pi[q];
        }
    }
    printf("%d\n",ct_sol);
    for(int i=1;i<=min(1000,ct_sol);++i)
        printf("%d ",sol[i]);
}
int main(){
    freopen("strmatch.in","r",stdin);
    freopen("strmatch.out","w",stdout);
    scanf("%s %s",A+1,B+1);
    n=strlen(A+1);
    m=strlen(B+1);
    prefix();
    KMP();
	return 0;
}