#include <bits/stdc++.h>
using namespace std;
const string FILE_NAME = "strmatch.";
ifstream fin(FILE_NAME + "in");
ofstream fout(FILE_NAME + "out");

vector<int> rabin_karp(string const& s, string const& t) {
    const int p = 31; //alphabet len
    const int m = 1e9 + 9;//mod
    int S = s.size(), T = t.size();

    vector<long long> p_pow(max(S, T));
    p_pow[0] = 1;
    for (int i = 1; i < (int)p_pow.size(); i++)
        p_pow[i] = (p_pow[i-1] * p) % m;

    vector<long long> h(T + 1, 0);
    for (int i = 0; i < T; i++)
        h[i+1] = (h[i] + (t[i] - 'A' + 1) * p_pow[i]) % m;
    long long h_s = 0;
    for (int i = 0; i < S; i++)
        h_s = (h_s + (s[i] - 'A' + 1) * p_pow[i]) % m;

    vector<int> occurrences;
    for (int i = 0; i + S - 1 < T; i++) {
        long long cur_h = (h[i+S] + m - h[i]) % m;
        if (cur_h == h_s * p_pow[i] % m)
            occurrences.push_back(i);
    }
    return occurrences;
}

int main() {
    string text, pattern;
    getline(fin, pattern);
    getline(fin, text);

    vector<int> ans = rabin_karp(pattern, text);
    fout << ans.size() << endl;
    for (int it : ans) {
        fout << it << ' ';
    }
    fout << endl;
    fout.close();
    return 0;
}