#include <bits/stdc++.h>

using namespace std;
const string TASK("strmatch");
ifstream fin(TASK + ".in");
ofstream fout(TASK + ".out");
#define cin fin
#define cout fout

const int N = 2e6 + 9;

char s[N], b[N];

int main()
{
    cin >> s >> b;
    int tar = strlen(s);

    int p = tar;
    s[p ++] = '$';
    int len = strlen(b);
    for(int i = 0; i < len; ++i)s[p ++] = b[i];
    s[p] = 0;

    int n = strlen(s);
    vector<int> z(n);
    int l = 0, r = 0;
    for(int i = 1; i < n; i++) {
        if(i < r) {
            z[i] = min(r - i, z[i - l]);
        }
        while(i + z[i] < n && s[z[i]] == s[i + z[i]]) {
            z[i]++;
        }
        if(i + z[i] > r) {
            l = i;
            r = i + z[i];
        }
    }

    vector<int> ans;
    for(int i = 0; i < n; ++i)
        if(z[i] == tar && ans.size() < 1000)
            ans.push_back(i - tar - 1);

    cout << ans.size() << '\n';
    for(auto i : ans)cout << i << ' ';
    return 0;
}