#include <bits/stdc++.h>

using namespace std;

const int nmax = 2000005;
char a[nmax], b[nmax];
int n, m, urm[nmax];
vector<int> sol;

int main()
{
    ifstream fin ("strmatch.in");
    ofstream fout ("strmatch.out");
    fin >> a >> b;
    n = strlen(a);
    m = strlen(b);
    int k = -1;
    urm[0] = 0;
    for (int i = 1; i < n; ++i){
        while(k > 0 && a[k+1] != a[i])
            k = urm[k];
        if(a[k+1] == a[i])
            ++k;
        urm[i] = k;
    }
    k = -1;
    for (int j = 0; j < m; ++j){
        while(k > 0 && a[k+1] != b[j])
            k = urm[k];
        if(a[k+1] == b[j])
            ++k;
        if(k == n-1){
            sol.push_back(j-n+1);
            k = urm[k];
        }
    }
    fout << sol.size() << "\n";
    for (int i = 0; i < sol.size() && i < 1000; ++i)
        fout << sol[i] << " ";
    return 0;
}