#include <iostream>
#include <fstream>
#include <vector>
using namespace std;

#define minn(a,b) (a<b? a : b)
const int LMAX=2e6 + 1;

string A,B;
int pi[LMAX];
void prefix()
{
    //indexarea incepe de la 0 deci unele valori din alg sunt decrementate cu 1
    int i=-1,y=A.size();
    for(int j=1;j<y;j++)
    {
        while(i>-1 && A[i+1]!=A[j])
            i=pi[i];
        if(A[i+1]==A[j])
            i++;
        pi[j]=i;
    }
}
int main()
{
    int i=-1,x,y,NR=0;
    ifstream f("strmatch.in");
    ofstream g("strmatch.out");
    f>>A>>B;
    f.close();
    x=B.size();
    y=A.size();
    vector <int> sol;
    if(y==1)
        pi[0]=-1;
    else
        pi[0]=0;
    if(y>1)
        prefix();
    for(int j=0;j<x;j++)
    {
        if(y>1)
            while(i>-1 && A[i+1]!=B[j])
                i=pi[i];
        if(A[i+1]==B[j])
            i++;
        if(i==y-1)
        {
            NR++;
            if(NR<=1000)
                sol.push_back(j-i);
            i=pi[i];
        }
    }
    g<<NR<<'\n';
    x=minn(NR,1000);
    for(i=0;i<x;i++)
        g<<sol[i]<<" ";
    return 0;
}