#include <fstream>
#include <cstring>

using namespace std;

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

char A[2000002], B[2000002], sir1[2000002], sir2[2000002];
int pi[2000002], v[1002];
int N, M, a;

int minim(int nr1, int nr2)
{
    if (nr1 <= nr2)
        return nr1;
    else
        return nr2;
}

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

void KMP()
{
    int q = 0;
    for (int i = 1; i <= M; ++i)
    {
        while (q > 0 && A[q + 1] != B[i])
            q = pi[q];
        if (A[q + 1] == B[i])
            q += 1;
        if (q == N)
        {
            ++a;
            if (a <= 1000)
                v[a] = i - N;
        }
    }
}

void afisare()
{
    fout << a << '\n';
    for (int i = 1; i <= minim(a, 1000); ++i)
        fout << v[i] << " ";
}

int main()
{
    fin.getline(sir1, 2000002);
    fin.getline(sir2, 2000002);

    N = strlen(sir1);
    M = strlen(sir2);

    for (int i = 1; i <= N; ++i)
        A[i] = sir1[i - 1];
    for (int j = 1; j <= M; ++j)
        B[j] = sir2[j - 1];

    prefix();
    KMP();

    afisare();

    fin.close();
    fout.close();
}