#include <bits/stdc++.h>

#define MaxN 2000005
#define MaxA 1000

std::ifstream InFile("strmatch.in");
std::ofstream OutFile("strmatch.out");
// JESUS
// CHRIST
// WHAT IS WRONG WITH MY CODE FOR REAL NOW JESUUUUUS
// VREAU SA DOOOOORM

char A[MaxN], B[MaxN];  // Sirurile citite (evident cu dimensiune foarte foarte foarte ok)
int M, N, NAns,         // M - pt B, N - pt A (de parca conteaza); NAns - cate pozitii am gasit
    LPS[MaxN];          // LPS[i] - poveste veche (A[0...i] lungime-1 a prefixului care e si sufix maxim)
std::vector <int> Ans;  // Retinem pozitiile care trb asezate, pana in foarte clara valoare MaxA 1000

void PrecomputeLPS() {
    int Len = 0;        // LPS[1] = 0
    for (int i=2; i<=N; ++i) {
        while (Len && A[i] != A[Len+1])     // Nu e potrivit bine, dam skip
            Len = LPS[Len];
        if (A[Len+1] == A[i])               // Marim lungimea daca trb
            ++Len;

        LPS[i] = Len;
    }
}

void KMP() {
    PrecomputeLPS();

    int Len = 0;
    for (int i=1; i<=M; ++i) {
        while(Len && B[i] != A[Len+1])     // Nu e potrivit bine, dam skip
            Len = LPS[Len];
        if (A[Len+1] == B[i])               // Marim lungimea daca trb
            ++Len;

        if (Len == N) {
            NAns ++;
            if (NAns+1 <= MaxA)
                Ans.push_back(i-N);
        }
    }
}

void Citire() {
    InFile >> A+1 >> B+1;
    N = strlen(A+1);
    M = strlen(B+1);
}

void Rezolvare() {
    KMP();

    OutFile << NAns << '\n';
    for (int i=0; i<Ans.size(); ++i)
        OutFile << Ans[i] << ' ' ;
}

int main()
{
    Citire();
    Rezolvare();

    return 0;
}