#include <fstream>
#include <vector>
#include <cstring>
#define NMAX 2000005

using namespace std;

int n, m, nr, k, q;
char P[NMAX], T[NMAX];
int ant[NMAX];
vector<int>sol;

void prefix()
{
    k=0;ant[1]=0;
    for(int i = 2; i <= n; ++i)
    {
        while(P[k+1] != P[i] && k > 0) k=ant[k];
        if(P[k+1] == P[i]) ++k;
        ant[i]=k;
    }
}

int main()
{
    ifstream f("strmatch.in");
    ofstream g("strmatch.out");

    f.getline(P+1,NMAX);
    n = strlen(P+1);
    f.getline(T+1,NMAX);
    m = strlen(T+1);

    prefix();

    q=0;
    for(int i = 1; i <= m; ++i)
    {
        while(P[q+1] != T[i] && q > 0) q=ant[q];
        if(P[q+1] == T[i]) ++q;
        if(q == n)
        {
            ++nr;
            if (nr <= 1000)
            {
                sol.push_back(i-n);
            }
        }
    }
    g<<nr<<"\n";
    for(int i = 0; i < sol.size(); ++i) g<<sol[i]<<" ";
    return 0;
}