///lgoritmul KMP
#include <fstream>
#include <cstring>
#include <cctype>
using namespace std;
ifstream fin ("strmatch.in");
ofstream fout("strmatch.out");
int i,sol,na,nb,V[2000003],S[1003],j,minim;
string A,B,s;
int main()
{
    fin>>s;
    A='0'+s;
    na=A.size()-1;
    fin>>s;
    B='0'+s;
    nb=B.size()-1;
    for(i=2;i<=na;i++)
    {
        while(A[i]!=A[j+1]&&j>0)
            j=V[j];
        if(A[i]==A[j+1])
            j++;
        V[i]=j;
    }
    j=0;
    for(i=1;i<=nb;i++)
    {
        while(B[i]!=A[j+1]&&j>0)
            j=V[j];
        if(B[i]==A[j+1])
            j++;
        if(j==na)
        {
            j=V[j];
            sol++;
            if(sol<=1000)
                S[sol]=i-na;
        }
    }
    fout<<sol<<"\n";
    minim=min(1000,sol);
    for(i=1;i<=minim;i++)
        fout<<S[i]<<" ";
    return 0;
}