#include <iostream>
#include <fstream>
#include <string.h>
#include <algorithm>

using namespace std;

int l, w;

char A [2000002];
char B [2000002];

int pos [1002];
int cnt = 0;
int H1 (char * w, int len)
{
    int H = 0;
    for(int i = 0; i < len; ++i)
        H = (H * 57 + w[i]) % 100007;
    return H;
}

int H2 (char * w, int len)
{
    int H = 0;
    for(int i = 0; i < len; ++i)
        H = (H * 57 + w[i]) % 100021;
    return H;
}

int naiv (char * mic, char * mare, int len)
{
    for(int i = 0; i < len; ++i)
        if(mic[i]!=mare[i])
            return 0;
    return 1;
}

int main()
{

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

    in>>A>>B;

    w = strlen(A);
    l = strlen(B);

    //cout<<w<<" "<<l<<"\n";
    int hashw1, hashw2;

    hashw1 = H1(A, w);
    hashw2 = H2(A, w);

    int hs1, hs2;
    for (int i = 0; i < l - w + 1; ++i)
    {
        hs1 = H1(B + i, w);
        if(hs1 == hashw1)
        {
            //cout<<"HASH EGAL!\n";
            if(naiv(A, B + i, w))
            {
                //cout<<"AVEM MATCH LA "<<i<<"\n";
                if(cnt < 1000)
                    pos[cnt] = i;
                ++cnt;
                //cout<<i<<" ";
            }
        }
    }
    out<<cnt<<"\n";
    for (int i = 0; i < min(cnt, 1000); ++i)
        out<<pos[i]<<" ";
    return 0;
}