#include <bits/stdc++.h>
#define nmax 2000000
using namespace std;

ifstream fin("strmatch.in");
ofstream fout("strmatch.out");

char text[nmax];
char pattern[nmax];

void LPS_config(char *pattern,int *lps,int N)
{
    int len=0;
    lps[0]=0;
    int i=1;
    while(i<N)
    {
        if(pattern[i]==pattern[len])
        {
            len++;
            lps[i]=len;
            i++;
        }else{
            if(len)
            {
                len=lps[len-1];
            }else{
                lps[i]=0;
                i++;
            }
        }
    }

}

void KMPSearch(char *pattern,char *text)
{
    int N,M,nr=0;
    N=strlen(pattern);
    M=strlen(text);
    int lps[M],v[M+1];
    LPS_config(pattern,lps,N);
    int i=0,j=0;
    while(i<M)
    {
        if(pattern[j]==text[i])
        {
            i++;
            j++;
        }
        if(j==N)
        {
            v[++nr]=i-j;
            j=lps[j-1];
        }else{
            if(i<M && pattern[j]!=text[i])
            {
                if(j)j=lps[j-1];
                else i++;
            }
        }
    }
    fout<<nr<<'\n';
    for(int i=1;i<=nr && i<=1000;i++)
    {
        fout<<v[i]<<' ';
    }
}

int main()
{
    fin>>pattern;
    fin>>text;
    KMPSearch(pattern,text);
    return 0;
}