#include <bits/stdc++.h>
using namespace std;

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

int pi[4000003];///pi[i] = cel mai lung prefix propriu al sirului s(1..i) care este si sufix al sirului s(1..i)
int afis[1001];

int main()
{
    string a, b;
    int cnt = 0;
    in >> a >> b;
    string s = '$' + a + '$' + b;
    for(int i = 2; i < s.size(); i++)
    {
        pi[i] = pi[i - 1];
        while(pi[i] && s[pi[i] + 1] != s[i])
            pi[i] = pi[pi[i]];
        if(s[pi[i] + 1] == s[i])
            pi[i]++;
    }
    for(int i = 1; i < s.size(); i++)
        if(pi[i] == a.size())
        {
            cnt++;
            if(cnt <= 1000)
                afis[cnt] = i - a.size() + 1 - a.size() - 2;
        }
    out << cnt << '\n';
    for(int i = 1; i <= min(cnt, 1000); i++)
        out << afis[i] << " ";
    return 0;
}