#include <bits/stdc++.h>

using namespace std;
ifstream fin("strmatch.in");
ofstream fout("strmatch.out");
#define ll long long
const int Nmax = 2000000 + 5;
char C[Nmax], P[Nmax];
ll nr1, nr2, bazam = 1;
int k;
vector<int>a;
int main()
{
    fin >> (P + 1) >> (C + 1);
    int n = strlen(P + 1), m = strlen(C + 1);
    for(int i = 1; i <= n; ++i)
        nr1 = nr1 * 127 + P[i];
    for(int i = 1; i <= n; ++i)
        nr2 = nr2 * 127 + C[i];
    for(int i = 2; i <= n; ++i)
        bazam = bazam * 127;
    for(int i = n + 1; i <= m; ++i)
    {
        nr2 = nr2 - (C[i - n] * bazam);
        nr2 = nr2 * 127 + C[i];
        if(nr2 == nr1)a.push_back(i - n);
    }
    fout << a.size() << '\n';
    for(int i = 0; i < a.size() && i < 1000; ++i)
        fout << a[i] << " ";
    return 0;
}