#include <bits/stdc++.h>
#define NMAX 2000005

using namespace std;

int sol[NMAX];
char S[NMAX], P[NMAX], T[NMAX];
ifstream fi("strmatch.in");
ofstream fo("strmatch.out");

int main()
{

    fi>>P+1;
    fi>>S+1;
    int n = strlen(P+1);
    int m = strlen(S+1);
    int nrsol = 0;

    T[0] = T[1] = 0;

    int k = 0;
    for(int i = 2; i <= n; ++i)
    {
        while( k > 0 && P[k+1] != P[i])
            k = T[k];

        if(P[k+1] == P[i])
            k++;

        T[i] = k;

    }
    k = 0;

    for(int i = 1; i <= m; ++i)
    {
        while( k > 0 && P[k+1] != S[i])
            k = T[k];

        if(P[k+1] == S[i])
            k++;

        if(k == n)
        {
            sol[++nrsol] = i - n;
            k = T[k];
        }
    }
    fo<<nrsol<<'\n';
    for(int i = 1; i <= min(nrsol, 1000); ++i)
        fo<<sol[i]<<" ";
}