#include <stdio.h>

#define NMax 2000005

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

void make_prefix(void)
{
    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(void)
{
    int i, q = 0, n = 0;

    freopen("strmatch.in", "r", stdin);
    freopen("strmatch.out", "w", stdout);

    char c;

    while(c!='\n')
        scanf("%c", &c),
        A[++M] = c;

    c = ' ';

    while(c!='\n')
        scanf("%c", &c),
        B[++N] = c;

    M--;
    N--;

    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;
        }
    }

    printf("%d\n", n);
    for (i = 1; i <= n; ++i)
        printf("%d ", pos[i]);
    printf("\n");

    return 0;
}