#include <iostream>
#include <fstream>
#include <vector>
#include <string.h>
#include <algorithm>
using namespace std;

#define NMAX 4000005

char v[NMAX];
int z[NMAX];

void z_func(char v[]) {
    const int n = strlen(v + 1);
    int l = 0, r = 0;
    z[1] = 0;
    for (int i = 2; i <= n; i++) {
        if (i <= r) {
            z[i] = min(r - i + 1, z[i - l + 1]);
        }
        while (i + z[i] <= n && v[i + z[i]] == v[z[i] + 1]) {
            z[i]++;
        }
        if (i + z[i] - 1 > r) {
            r = i + z[i] - 1;
            l = i;
        }
    }
}

int main()
{
    ifstream f("strmatch.in");
    ofstream g("strmatch.out");
    f >> (v + 1);
    int n = strlen(v + 1);
    v[n + 1] = '$';
    f >> (v + n + 2);

    z_func(v);

    vector <int> sol;
    int cnt = 0, m = strlen(v + 1);
    for (int i = n + 2; i <= m; i++) {
        if (z[i] == n) {
            cnt++;
            if (cnt <= 1000) {
                sol.push_back(i - n - 2);
            }
        }
    }
    g << cnt << '\n';
    for (const auto& x:sol) {
        g << x << " ";
    }
    g.close();
    return 0;
}