#include <bits/stdc++.h>
using namespace std;
ifstream in("strmatch.in");
ofstream out("strmatch.out");
const int NMax=2000005;
char A[NMax], B[NMax];
int M,N,pre[NMax], pos[1024];
void prefix()
{
    int i, q = 0;
    for (i = 2, pre[1] = 0; i <= M; ++i)
    {
        while (q && A[q+1] != A[i])
            q = pre[q];
        if (A[q+1] == A[i])
            ++q;
        pre[i] = q;
    }
}

int main(void)
{
    int i, q = 0, n = 0;
    in.getline(A,sizeof(A));
    in.getline(B,sizeof(B));
    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);
            cout<<M;
    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 = pre[q];
        if (A[q+1] == B[i])
            ++q;
        if (q == M)
        {
            q = pre[M];
            ++n;
            if (n <= 1000)
                pos[n] = i-M;
        }
    }
    out<<n<<'\n';
    for (i = 1; i <= min(n, 1000); ++i)
        out<<pos[i]<<' ';
    return 0;
}