#include <fstream>
#include <cstring>
using namespace std;

const int N=2000002;
char a[N],text[N];
int p[N],rez[N];

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

void kmp(char text[],char a[])
{
    int m=strlen(a+1),i,j;
    p[0]=-1;
    for (i=2;a[i];i++)
        for (int j=p[i-1];j>=0;j=p[j])
            if (a[j+1]==a[i])
            {
                p[i]=j+1;
                break;
            }
    for (i=1,j=-1;text[i];i++)
        for (j++;j>=0;j=p[j])
            if (a[j+1]==text[i])
            {
                if (j==m-1)
                    rez[++rez[0]]=i-m;
                break;
            }
}

int main()
{
    in>>a+1>>text+1;
    kmp(text,a);
    out<<rez[0]<<"\n";
    rez[0]=min(rez[0],1000);
    for (int i=1;i<=rez[0];i++)
        out<<rez[i]<<" ";
    out<<"\n";
    return 0;
}