#include <fstream>
#include <cstring>

using namespace std;

const int nMax = 2000050;
char a[nMax],b[nMax];
int l1,l2;
int pi[nMax];
int pos[1024];
int n;

void citire()
{
    ifstream f("strmatch.in");
    f.get(a+1,nMax);
    l1 = strlen(a+1);
    f.get();
    f.get(b+1,nMax);
    l2 = strlen(b+1);
    f.close();
}

void makePrefix()
{
    int q = 0;
    pi[1] = 0;

    for(int i=2;i<=l1;++i)
    {
        while(q>0&&a[q+1]!=a[i])
            q=pi[q];
        if(a[q+1]==a[i])
            ++q;
        pi[i] = q;
    }
}

void kmp()
{
    int q = 0;
    makePrefix();
    for(int i=1;i<=l2;++i)
    {
        while(q>0&&a[q+1]!=b[i])
            q = pi[q];
        if(a[q+1] == b[i])
            q++;

        if(q==l1)
        {
            q = pi[q];
            if(n<1000)
                pos[n] = i-l1;
            n++;
        }
    }
}

void afisare()
{
    ofstream h("strmatch.out");
    h<<n<<'\n';
    for(int i=0; i<min(n,1000);++i)
        h<<pos[i]<<" ";
    h.close();
}

int main()
{
    citire();
    kmp();
    afisare();
    return 0;
}