#include <bits/stdc++.h>

using namespace std;

const int MAXN = 2e6 + 1;

int pi[MAXN];
int sol[1001];

ifstream f("strmatch.in");
ofstream g("strmatch.out");

int main(){
    string a, b;
    f >> a >> b;
    pi[0] = 0;
    int q = 0;
    for(int i = 1; i < a.size(); ++ i){
        while(q && a[q+1] != a[i]) q = pi[q];
        if(a[q+1] == a[i]) ++ q;
        pi[i] = q-1;
    }

    int cnt = 0;
    q = 0;

    for(int i = 0; i < b.size(); ++i){
        while(q && a[q+1] != b[i]) q = pi[q];
        if(a[q+1] == b[i]) ++ q;
        if(q == a.size()-1){
            q = pi[q];
            ++cnt;
            if(cnt <= 1000){
                sol[cnt] = i-a.size()+1;
            }
        }
    }

    g << cnt << '\n';
    for(int i = 1; i <= min(1000, cnt); ++i){
        g << sol[i] << ' ';
    }
    return 0;
}