#include <iostream>
#include <fstream>
#include <vector>
#include <string.h>

using namespace std;

const int maxn = 2000005;

int n, m, pi[maxn];
char a[maxn], b[maxn];
vector <int> match;

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

    fin.getline(a + 1, maxn);
    fin.getline(b + 1, maxn);

    n = strlen(a + 1);
    m = strlen(b + 1);

    int k = 0; pi[1] = 0;
    for(int i = 2 ; i <= n ; ++ i) {
        while(k > 0 && a[k + 1] != a[i])
            k = pi[k];
        if(a[k + 1] == a[i])
            ++ k;
        pi[i] = k;
    }
    k = 0;
    for(int i = 1 ; i <= m ; ++ i) {
        while(k > 0 && a[k + 1] != b[i])
            k = pi[k];
        if(a[k + 1] == b[i])
            ++ k;
        if(k == n)
            match.push_back(i - n);
    }
    fout << match.size() << '\n';
    for(int i = 0 ; i < min(1000, (int)(match.size())) ; ++ i)
        fout << match[i] << ' ';
}