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

using namespace std;

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

const int NMAX = 2000000 + 5;

int N, M;
char a[NMAX], b[NMAX];

int pi[NMAX];
vector <int> sol;

void Read()
{
    fin >> a >> b;

    N = strlen(a);
    M = strlen(b);

    for(int i = N; i >= 1; i--)
        a[i] = a[i - 1];

    for(int i = M; i >= 1; i--)
        b[i] = b[i - 1];
}

void Pi()
{
    int j = 0;

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

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

        pi[i] = j;
    }
}

void Kmp()
{
    int j = 0;

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

        if(a[j + 1] == b[i])
            j++;

        if(j == N)
        {
            sol.push_back(i - N);

            j = pi[j];
        }
    }
}

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

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

int main()
{
    Read();

    Pi();

    Kmp();

    Write();

    return 0;
}