#include<bits/stdc++.h>
using namespace std;

vector<int> kmp(string &p, string &t) {
    int n = p.size();
    p = '#' + p;
    t = '#' + t;
    p += t;
    //int n = s.size();
    vector<int> pi((int)p.size(), 0);
    for(int i = 2; i < (int)p.size(); i++) {
        int j = pi[i - 1];
        while(j > 0 && p[i] != p[j + 1]) {
            j = pi[j];
        }
        if(p[i] == p[j + 1]) {
            j++;
        }
        pi[i] = j;
    }
    vector<int> res;
    for(int i = 0; i < (int)p.size(); i++) {
        //cout << pi[i] << ' ';
        if(pi[i] == n) {
            res.push_back(i - 2 * n - 1);
        }
    }
    return res;
}

int main() {
    ifstream f("strmatch.in");
    ofstream g("strmatch.out");
    string p, t;
    f >> p >> t;
    vector<int> pos = kmp(p, t);
    g << pos.size() << '\n';
    for(int i = 0; i < (int)pos.size(); i++) {
        g << pos[i] << ' ';
    }
    return 0;
}