#include <fstream>
#include <iostream>
#include <string.h>
using namespace std;

const int NMax=2000005;
int M, N;
char A[NMax], B[NMax];
int pi[NMax], pos[1024];

void make_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 i, q = 0, n = 0;

    ifstream f("strmatch.in");
    ofstream g("strmatch.out");
    f>>A;
    f>>B;
    M=strlen(A);
    N=strlen(B);
    for (i = M; i; --i) A[i] = A[i-1]; A[0] = ' ';
    for (i = N; i; --i) B[i] = B[i-1]; B[0] = ' ';
    make_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;
            else break;
        }
    }
    n=min(n,1000);
    g<<n<<'\n';
    for (i = 1; i <= n; i++)
        g<<pos[i]<<" ";
    g<<'\n';

}