#include <bits/stdc++.h>

using namespace std;

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

const int nmax = 2000005;
string a, b;
int pi[nmax];

int main(){
    fin >> a >> b;
    int n = a.size(), m = b.size();
    int l = 0;
    for (int i = 1; i < n; ++i){
        while (l > 0 && a[l] == a[i]){
            l = pi[l - 1];
        }
        if (a[l] == a[i]) ++l;
        pi[i] = l;
    }
    l = 0;
    vector <int> ans;
    for (int i = 0; i < m; ++i){
        while (l > 0 && a[l] != b[i]){
            l = pi[l - 1];
        }
        if (a[l] == b[i]) ++l;
        if (l == n){
            l = pi[l - 1];
            if (ans.size() < 1000){
                ans.push_back(i - n + 1);
            }
            else{
                break;
            }
        }
    }
    fout << ans.size() << "\n";
    for (auto it : ans){
        fout << it << " ";
    }
    fin.close();
    fout.close();
    return 0;
}