#include <fstream>
#include <cstring>
#include <vector>

using namespace std;

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

const int MAX_LEN = 2e6;

int N, M;
char p[MAX_LEN + 5], text[MAX_LEN];

int pi[MAX_LEN + 5];

vector <int> sol;

void Read()
{
    fin >> (p + 1) >> (text + 1);

    N = strlen(p + 1);
    M = strlen(text + 1);

}

void CalcPi()
{
    int j = 0;

    for(int i = 2; i <= N; i++)
    {
        while(j != 0 && p[i] != p[j + 1])
            j = pi[j];

        if(p[i] == p[j + 1])
            j++;

        pi[i] = j;
    }
}

void KMP()
{
    int j = 0;

    for(int i = 1; i <= M; i++)
    {
        while(j != 0 && text[i] != p[j + 1])
            j = pi[j];

        if(text[i] == p[j + 1])
            j++;

        if(j == N)
            {
                sol.push_back(i - N);
                j = pi[j];
            }
    }
}

void Write()
{
    fout << sol.size() << '\n';

    for(int i = 0; i < min(1000, (int)sol.size()); i++)
        fout << sol[i] << ' ';
}

int main()
{
    Read();

    CalcPi();

    KMP();

    Write();

    return 0;
}