#include <bits/stdc++.h>
#define NMAX 2000005
using namespace std;

ifstream fin("strmatch.in");
ofstream fout("strmatch.out");
int urm[NMAX];
char A[NMAX], B[NMAX];
int n, m, c;
vector <int> sol(NMAX);

void Next(char *A) {
    int k=0;
    urm[1]=0;
    for(int i=2; i<=n; i++) {
        while(k>0 && A[k+1]!=A[i]) k=urm[k];
        if(A[k+1]==A[i]) k++;
        urm[i]=k;
    }
}

int main()
{
    int x=0;
    fin.getline(A, sizeof(A));
    fin.getline(B, sizeof(B));
    n=strlen(A); m=strlen(B);
    Next(A);
    for(int i=0; i<=m; i++) {
        while(x>0 && A[x+1]!=B[i]) x=urm[x];
        if(A[x+1]==B[i]) x++;
        if(x==n-1) {
            sol[c++]=i-n+1;
            x=urm[x];
        }
    }
    fout<<c<<endl;
    for(int i=0; i<(c>1000 ? 1000 : c); i++)
        fout<<sol[i]<<' ';
    return 0;
}