//problema KMP
#include <iostream>
#include <fstream>
#include <string>
using namespace std;
#define DIM 2000001
#define DIM2 1008
ifstream fin("strmatch.in");
ofstream fout("strmatch.out");
int lps[DIM],indici[DIM2],nr_indici,n,m;
char pat[DIM],txt[DIM];
void prelucrareLPS()
{
    int len=0,i=1;
    lps[0]=0;
    while(i<m)
    {
        if(pat[i]==pat[len])
        {
            len++;
            lps[i]=len;
            i++;
        }
        else
        {
            if(len!=0)
            {
                len=lps[len-1];
            }
            else
            {
                lps[i]=0;
                i++;
            }
        }
    }
}
void KMP()
{
    int i=0,j=0;
    prelucrareLPS();
    while(i<n)
    {
        if(pat[j]==txt[i])
        {
            i++;j++;
        }
        if(j==m)
        {
            indici[nr_indici++]=i-j;
            j=lps[j-1];
        }
        else if(i<n && pat[j]!=txt[i])
        {
            if(j!=0)
            {
                j=lps[j-1];
            }
            else
            {
                i++;
            }
        }
    }
}
int main()
{
    char c;bool k=true;
    while(fin>>c)
    {
        pat[m++]=c;
    }
    while(fin>>c)
    {
        txt[n++]=c;
    }
    KMP();
    fout<<nr_indici<<'\n';
    for(int i=0;i<nr_indici && i<1000;i++)
    {
        fout<<indici[i]<<" ";
    }
}