#include<fstream>
#include<cstring>
#define MAX_N 2000010
using namespace std;

ifstream f("strmatch.in");
ofstream g("strmatch.out");
char A[MAX_N],B[MAX_N];
int urm[MAX_N],sol[1005],n,m,nr;

void buildPrefix()
{
    int i, k=0;
    n=strlen(A);
    for (i=2; i<=n; i++)
    {
        while (k && A[k] != A[i-1]) k = urm[k];
        if (A[k] == A[i-1]) k++;
        urm[i]=k;
    }
}

void potrivire()
{

    int i, k = 0;;
    m=strlen(B);
    for (int i = 0; i < m; i++)
    {
        while (k && A[k] != B[i]) k = urm[k];
        if (A[k] == B[i]) k++;
        if (k==n)
        {
            nr++;
            if (nr<=1000) sol[nr] = i - n + 1;
        }
    }
}

int main()
{

    f>>A>>B;
    buildPrefix();
    potrivire();
    g<<nr<<'\n';
    for(int i = 1; i <= min(nr,1000); i++) g<<sol[i]<<" ";
    return 0;
}