// KMP - O(N+M)
#include <fstream>
#include <cstring>
#define Nmax 2000099
using namespace std;
ifstream f("strmatch.in");
ofstream g("strmatch.out");

int N,M,phi[Nmax],sol,v[1009];
char A[Nmax],B[Nmax];

void MakePrefix()
{
    int q=0;
    phi[1]=0;
    for(int i=2;i<=N;++i)
    {
        while(q && A[q+1]!=A[i])q=phi[q];
        if(A[q+1]==A[i])++q;
        phi[i]=q;
    }
}

void KMP()
{
    int q=0;
    for(int i=1;i<=M;++i)
    {
        while(q && A[q+1]!=B[i])q=phi[q];
        if(A[q+1]==B[i])++q;
        if(q==N && ++sol<=1000)v[sol]=i-N; //index de la 0
    }
}
int main()
{
    f>>A+1>>B+1;
    N=strlen(A+1) , M=strlen(B+1);
    MakePrefix();
    KMP();
    g<<sol<<'\n';
    for(int i=1;i<=min(sol,1000);++i)g<<v[i]<<' ';
    g<<'\n';
    f.close();g.close();
    return 0;
}