#include <bits/stdc++.h>

#define MAXN 2000005

char A[MAXN], B[MAXN];
int N, M;
int LPS[MAXN];

void ComputeLPS() {
    int Len = 0;
    for (int i=2; i<=N; ++i) {
        while (Len && A[i] != A[Len+1])
            Len = LPS[Len];
        if (A[Len+1] == A[i])
            ++ Len;
        LPS[i] = Len;
    }
}

std::vector <int> Ans;

void KMP() {
    ComputeLPS();
    for (int i=1, j=0; i<=M; ++i) {
        while (j && B[i] != A[j+1])
            j = LPS[j];
        if (B[i] == A[j+1])
            ++j;

        if (j == N)
            Ans.push_back(i-N);
    }
}

std::ifstream In("strmatch.in");
std::ofstream Out("strmatch.out");

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

void Rezolvare() {
    KMP();
    Out << Ans.size() << '\n';
    for (int i=0; i<Ans.size(); ++i)
        Out << Ans[i] << ' ' ;
}

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

    return 0;
}