#include <bits/stdc++.h>
using namespace std;
const int NMAX = 2e6+2;
string a,b,c;
int n,m,p[2*NMAX];

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

int main()
{
    getline(fin, a);
    getline(fin, b);
    n = a.size();
    m = b.size();
    c = "$"+a+b;
    int l = 0;
    vector<int> ans;
    for(int i = 2; i <= n+m; i++){
        if(i == n+1){
            l = 0;
        }
        while(l != 0 && c[i] != c[l+1]){
            l = p[l];
        }
        if(c[i] == c[l+1]){
            l++;
        }
        if(i >= 2*n){
            if(l == n){
                ans.push_back(i-2*n);
                l = p[l];
            }
        }
        p[i] = l;
    }
    fout << ans.size() << "\n";
    for(int i = 0; i < ans.size() && i < 1000; i++){
        fout << ans[i] << " ";
    }
    return 0;
}