#include <bits/stdc++.h>
#define P 123457
#define Q 777013
using namespace std;

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

int n, m, cnt, codA1, codA2, codB1, codB2, p1, p2;
int cod[256];
vector<int> sol;
char a[2000005], b[2000005];

int main()
{
    int i, j;
    j = 0;
    for (i = '0'; i <= '9'; i++)
        cod[i] = j++;
    for (i = 'a'; i <= 'z'; i++)
        cod[i] = j++;
    for (i = 'A'; i <= 'Z'; i++)
        cod[i] = j++;


    fin >> a;
    fin >> b;
    n = strlen(a);
    m = strlen(b);
    p1 = p2 = 1;
    for (i = 0; i < n; i++)
    {
        codA1 = (codA1 * 62 + cod[a[i]]) % P;
        codA2 = (codA2 * 62 + cod[a[i]]) % Q;
        codB1 = (codB1 * 62 + cod[b[i]]) % P;
        codB2 = (codB2 * 62 + cod[b[i]]) % Q;
        if (i > 0)
        {
            p1 = (p1 * 62) % P;
            p2 = (p2 * 62) % Q;
        }
    }
    if (codA1 == codB1 && codA2 == codB2)
    {
        cnt++;
        sol.push_back(0);
    }
    for (i = n; i < m; i++)
    {
        codB1 = ((codB1 - cod[b[i - n]] * p1 % P + P) * 62 + cod[b[i]]) % P;
        codB2 = ((codB2 - cod[b[i - n]] * p2 % Q + Q) * 62 + cod[b[i]]) % Q;
        if (codA1 == codB1 && codA2 == codB2)
        {
            cnt++;
            sol.push_back(i - n + 1);
        }
    }
    fout << cnt << "\n";
    for (int e : sol)
        fout << e << " ";
    fout << "\n";
    fin.close();
    fout.close();
    return 0;
}