#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
#define mod1 666013
#define p 27
#define mod2 7564321
using namespace std;
int hash1,hash2,curenthash1,curenthash2,p11,n,m,nr,i;
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);
hash1=0; hash2=0; p11=1;
for (i=1;i<=n;i++) {
    hash1=(hash1*p+s[i])%mod1;
    hash2=(hash2*p+s[i])%mod2;
    if (i>1) p11=p11*p;
}
if (n>m) { printf("0"); return 0; }
curenthash1=0; curenthash2=0;
for (i=1;i<=n;i++) {
    curenthash1=(curenthash1*p+ss[i])%mod1;
    curenthash2=(curenthash2*p+ss[i])%mod2;
}
if (curenthash1==hash1 && curenthash2==hash2) nr=1,sol.push_back(0);
for (i=n+1;i<=m;i++) {
    curenthash1=(((curenthash1-p11*(ss[i-n])%mod1+mod1)%mod1)*p+ss[i]);
    curenthash2=(((curenthash2-p11*(ss[i-n])%mod2+mod2)%mod2)*p+ss[i]);
    if (curenthash1==hash1 && curenthash2==hash2) {
        nr++;
        if (nr<=1000) sol.push_back(i-n);
    }
}
printf("%d\n",nr);
for (i=0;i<sol.size();i++) printf("%d ",sol[i]);
return 0;
}