#include <stdio.h>
#include <iostream>
#include <cstring>
#include <stdlib.h>
#include <time.h>
#include <bitset>
#include <string>
#include <vector>
#include <math.h>
#include <stack>
#include <queue>
#include <list>
#include <set>
#include <map>
#include <limits.h>
#include <algorithm>
#include <deque>
#define nmax 2000010
using namespace std;
int n,m,i,k,urm[nmax],nr=0;
char s[nmax],ss[nmax];
vector <int> sol;
int main(){
freopen("strmatch.in","r",stdin);
freopen("strmatch.out","w",stdout);
gets(s+1); n=strlen(s+1);
gets(ss+1); m=strlen(ss+1);
k=0; urm[1]=0;
for (i=2;i<=n;i++){
    while (k>0 && s[k+1]!=s[i]) k=urm[k];
    if (s[k+1]==s[i]) k++;
    urm[i]=k;
}
k=0;
for (i=1;i<=m;i++) {
    while (k>0 && ss[i]!=s[k+1]) k=urm[k];
    if (ss[i]==s[k+1]) k++;
    if (k==n){
        nr++;
        if (nr<=1000) sol.push_back(i-n);
        k=urm[k];
    }
}
printf("%d\n",nr);
for (i=0;i<sol.size();i++) printf("%d ",sol[i]);
return 0;
}