#include <iostream>
#include <fstream>
#include <cstring>
using namespace std;

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

const int maxn = 2e6 + 5;
char String[maxn], Pattern[maxn];
int Pi[maxn], Ans[maxn];
int lg, n, m;

void Prefix() {
    int x = 0;
    for (int i = 2; i <= m; i++) {
        if (x > 0 && Pattern[x + 1] != Pattern[i]) x = Pi[x];
        if (Pattern[x + 1] == Pattern[i]) x++;
        Pi[i] = x;
    }
}

void KMP() {
    Prefix();
    int x = 0;
    for (int i = 1; i <= n; i++) {
        while (x > 0 && Pattern[x + 1] != String[i]) x = Pi[x];
        if (Pattern[x + 1] == String[i]) x++;
        if (x == m) {
            Ans[++lg] = i - m;
            x = Pi[x];
        }
    }
}

int main() {
    ios_base :: sync_with_stdio(false);
    fin >> (Pattern + 1);
    fin >> (String + 1);
    n = strlen(String + 1);
    m = strlen(Pattern + 1);
    KMP();
    fout << lg << "\n";
    lg = min(lg, 1000);
    for (int i = 1; i <= lg; i++) {
        fout << Ans[i] << " ";
    }
    fout << "\n";
    return 0;
}