#include <fstream>
#include <cstring>
#define MAX 2000000
using namespace std;
ifstream f("strmatch.in"); ofstream g("strmatch.out");
int U[MAX], n, m, sol[MAX], nr;
char T[MAX], P[MAX];
void Prel(char P[])
{
    int x, k=-1;
    for(x=1; x<m; x++)
    {
        while(k>0 and P[k+1]!=P[x]) k=U[k];
        if(P[k+1]==P[x]) k++;
        k=U[k];
    }
}
void KMP()
{
    int i, k=-1;
    for(i=0; i<n; i++)
    {
        while(k>0 and P[k+1]!=T[i]) k=U[k];
        if(P[k+1]==T[i])k++;
        if(k==m-1)
        {
            sol[++nr]=i-m+1;
            k=U[k];
        }
    }
}
int main()
{
    f.getline(P, MAX);
    f.getline(T, MAX);
    n=strlen(T);
    m=strlen(P);
    KMP();
    g<<nr<<'\n';
    for(int i=1; i<=nr; i++) g<<sol[i]<<' ';
    return 0;
}