#include <fstream>
#include <cstring>

#define PRIM1 100007
#define PRIM2 100021

using namespace std;

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

char N[2000005], M[2000005];
int i, n, m, valori, p[1005];
int putere1, putere2, hash11, hash12, hash21, hash22, val;

bool prim(int x){
    int d;
    for(d = 2; d * d <= x && x % d != 0; d++);
    return d*d > x ? 1 : 0;
}

int main()
{
    fin >> M >> N;
    putere1 = putere2 = 1;
    n = strlen(N);
    m = strlen(M);
    if(m > n){
        fout << 0;
        return 0;
    }
    hash11 = hash12 = 0;
    for(i = 0; i<=m-1; i++){
        hash11 = (hash11 * 73 + M[i]) % PRIM1;
        hash12 = (hash12 * 73 + M[i]) % PRIM2;
        if(i != 0){
            putere1 = (putere1 * 73) % PRIM1;
            putere2 = (putere2 * 73) % PRIM2;
        }
    }
    hash21 = hash22 = 0;
    for(i = 0; i<=m-1; i++){
        hash21 = (hash21 * 73 + N[i]) % PRIM1;
        hash22 = (hash22 * 73 + N[i]) % PRIM2;
    }
    if(hash11 == hash21 && hash12 == hash22){
        valori++;
        p[valori] = 0;
    }
    int ok = 1;
    for(i = m; i<n && ok; i++){
        hash21 = ((hash21 - (N[i-m]*putere1) % PRIM1 + PRIM1) * 73 + N[i]) % PRIM1;
        hash22 = ((hash22 - (N[i-m]*putere2) % PRIM2 + PRIM2) * 73 + N[i]) % PRIM2;
        if(hash11 == hash21 && hash12 == hash22){
            valori++;
            p[valori] = i-m+1;
        }
        if(valori == 1000){
            ok = 0;
        }
    }
    fout << valori << '\n';
    for(i = 1; i<=valori; i++){
        fout << p[i] << ' ';
    }

    return 0;
}