///KMP
#include <iostream>
#include <fstream>
#include <cstring>
#define nmax 2000005

using namespace std;

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

int n, m;
char a[nmax], b[nmax];
int pos[1005], p[nmax];

void prefix()
{
    int q=0;
    p[1]=0;
    for(int i=2; i<=n; ++i)
    {
        if(q && a[q+1]!=a[i]) q=p[q];
        if(a[q+1]==a[i]) ++q;
        p[i]=q;
    }
}

int main()
{
    f>>a;
    f>>b;
    for(; (a[n]>='A' && a[n]<='Z') || (a[n]>='a' && a[n]<='z') || (a[n]>='0' && a[n]<='9'); ++n);
    for(; (b[m]>='A' && b[m]<='Z') || (b[m]>='a' && b[m]<='z') || (b[m]>='0' && b[m]<='9'); ++m);
    for(int i=n; i>0; --i) a[i]=a[i-1];
    a[0]=' ';
    for(int i=m; i>0; --i) b[i]=b[i-1];
    b[0]=' ';
    prefix();
    int q=0, nr=0;
    for(int i=1; i<=m; ++i)
    {
        if(q && a[q+1]!=b[i]) q=p[q];
        if(a[q+1]==b[i]) ++q;
        if(q==n)
        {
            q=p[n];
            ++nr;
            if(nr<=1000)
            {
                pos[nr]=i-n;
            }
        }
    }
    g<<nr<<"\n";
    if(nr<=1000)
    {
        for(int i=1; i<=nr; ++i)
        {
            g<<pos[i]<<" ";
        }
    }

    return 0;
}