#include <bits/stdc++.h>

using namespace std;

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

const int nmax = 2000000 + 10;

string s , p;
int phi[nmax] , pos[nmax];
int n , m , k , i , nr;

int main()
{

fin >> p;
n = p.size();
p = '$' + p + '$';

fin >> s;
m = s.size();
s = '$' + s;

phi[1] = 0;
for (i = 2 ; i <= n ; ++i)
{
    k = phi[i - 1];

    while (k > 0 && p[i] - p[k + 1]) k = phi[k];

    if (p[i] == p[k + 1]) phi[i] = k + 1;
    else phi[i] = 0;
}

k = 0;
for (i = 1 ; i <= m ; ++i)
{
    while (k > 0 && s[i] - p[k + 1]) k = phi[k];
    if (s[i] == p[k + 1]) k += 1;

    if (k == n)
    {
        nr += 1;
        if (nr <= 1000) pos[nr] = i - n;
    }
}

fout << nr << '\n';

for (i = 1 ; i <= min(1000 , nr) ; ++i)
fout << pos[i] << " ";

return 0;
}