#include <iostream>
#include <fstream>
#include <cstring>

using namespace std;

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

const int NMAX=2000001;

int M, N;
char A[NMAX], B[NMAX];
int pi[NMAX], pos[1001];

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

int main()
{
    int q=0,n=0,i;
    f.getline(A,NMAX);
    //M=f.gcount()-1;
    f.getline(B,NMAX);
   // N=f.gcount()-1;

    for (; (A[M] >= 'A' && A[M] <= 'Z') || (A[M] >= 'a' && A[M] <= 'z') || (A[M] >= '0' && A[M] <= '9'); ++M);
    for (; (B[N] >= 'A' && B[N] <= 'Z') || (B[N] >= 'a' && B[N] <= 'z') || (B[N] >= '0' && B[N] <= '9'); ++N);
    for (i = M; i; --i) A[i] = A[i-1]; A[0] = ' ';
    for (i = N; i; --i) B[i] = B[i-1]; B[0] = ' ';

    prefix();
    for (i = 1; i <= N; ++i)
    {
        while (q && A[q+1] != B[i])
            q = pi[q];
        if (A[q+1] == B[i])
            ++q;
        if (q == M)
        {
            q = pi[M];
            ++n;
            if (n <= 1000)
                pos[n] = i-M;
        }
    }
    int minn=min(n,1000);
    g<<n<<'\n';
    for (i = 1; i <= minn; i++)
        g<<pos[i]<<' ';
    return 0;
}