#include <iostream>
#include <fstream>
#include <string.h>
#include <vector>
#define N_MAX 2000005
using namespace std;
ifstream f("strmatch.in");
ofstream g("strmatch.out");
char P[N_MAX], T[N_MAX];
int Pi[N_MAX], k, m, n;
vector <int> v;
int main()
{
    f >> (P + 1);
    f >> (T + 1);
    n = strlen(P + 1);
    m = strlen(T + 1);
    k = 0;
    for(int i = 2; i <= n; i++)
    {
        while(k > 0 && P[k + 1] != P[i])
            k = Pi[k];
        if(P[k + 1] == P[i])
            k++;
        Pi[i] = k;
    }
    k = 0;
    for(int i = 1; i <= m; i++)
    {
        while(k > 0 && P[k + 1] != T[i])
            k = Pi[k];
        if(P[k + 1] == T[i])
            k++;
        if(k == n)
        {
            v.push_back(i - k);
            k = Pi[k];
        }
    }
    g << v.size() << "\n";
    for(int i = 0; i < 1000; i++) g << v[i] << " ";
    return 0;
}