#include <bits/stdc++.h>
#define N_MAX 2000005
#define ANS_MAX 10000

using namespace std;

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

char s[N_MAX], S[N_MAX];
int N, M, pi[N_MAX], k;

vector < int > Ans;

int main()
{
    fin >> (s + 1);
    N = strlen(s + 1);

    for (int i = 2; i <= N; i++)
    {
        while ((k > 0) && s[k + 1] != s[i])
            k = pi[k];
        if (s[k + 1] == s[i])
            k++;
        pi[i] = k;
    }

    fin >> (S + 1);
    M = strlen(S + 1);

    k = 0;
    for (int i = 2; i <= M && Ans.size() < ANS_MAX; i++)
    {
        while (k > 0 && s[k + 1] != S[i])
            k = pi[k];
        if (s[k + 1] == S[i])
            k++;
        if (k == N)
            Ans.push_back(i - N);
    }

    fout << Ans.size() << "\n";
    for (int poz: Ans)
        fout << poz << " ";
    return 0;
}