#include <iostream>
#include <fstream>

using namespace std;

ifstream f("strmatch.in");
ofstream g("strmatch.out");

char a[100001], b[100001];
int pod[100001], poz[100001];
int M, N, i, n, q;

void prefixare()
{
    int i = 0, q = 0;
    for (i = 2; i <= M; i++)
    {
        while (q && a[q+1] != a[i])
            q = pod[q];
        if (a[q+1] == a[i])
            q++;
        pod[i] = q;
    }
}

int main()
{
    f.get(a, sizeof(a));
    f.get();
    for (; (a[M] >= '0' && a[M] <= '9') || (a[M] >= 'A' && a[M] <= 'Z') || (a[M] >= 'a' && a[M] <= 'z'); M++);
    f.get(b, sizeof(b));
    for (; (b[N] >= '0' && b[N] <= '9') || (b[N] >= 'A' && b[N] <= 'Z') || (b[N] >= 'a' && b[N] <= 'z'); N++);

    for (i = M; i >= 1; i--)
        a[i] = a[i-1];
    a[0] = ' ';

    for (i = N; i >= 1; i--)
        b[i] = b[i-1];
    b[0] = ' ';

    prefixare();

    for (i = 2; i <= N; i++)
    {
        while (q && a[q+1] != b[i])
            q = pod[q];
        if (a[q+1] == b[i])
            q++;
        if (q == M)
            q = pod[M], n++, poz[n] = i-M;
    }

    g << n << '\n';
    for (i = 1; i <= min(n, 1000); i++)
        g << poz[i] << " ";
    return 0;
}