#include <fstream>
#include<cstring>
#define NMAX 2000005
using namespace std;
ifstream fin("strmatch.in");
ofstream fout("strmatch.out");
char a[NMAX],b[NMAX];
int n,m,k,sol[NMAX];
int lps[NMAX];//longest proper prefix which is also suffix
void computeLPS(char *a,int n,int *lps)
{
    int lg=0;
    lps[0]=0;
    int i=1;
    while(i<n)
    {
        if(a[i]==a[lg])
        {
            lg++;
            lps[i]=lg;
            i++;
        }
        else
        {
            if(lg)
                lg=lps[lg-1];
            else
            {
                lps[i]=0;
                i++;
            }
        }
    }
}
void KMP()
{
    computeLPS(a,n,lps);
    int i=0;/// pt b
    int j=0;/// pt a
    while(i<m)
    {
        if(a[j]==b[i])
            i++,j++;
        if(j==n)
        {
            sol[++k]=i-j;
            j=lps[j-1];
        }
        else
            if(i<m&&a[j]!=b[i])
        {
            if(j)
             j=lps[j-1];
            else
                i++;
        }
    }
}
int main()
{
    fin>>a;
    fin>>b;
    n=strlen(a);
    m=strlen(b);
    KMP();
    fout<<k<<"\n";
    for(int i=1;i<=k;i++)
        fout<<sol[i]<<" ";
    return 0;
}