#include <stdio.h>
#define  minim(a, b) ((a < b) ? a : b)
#define Nmax 2000005
using namespace std;
char A[Nmax],B[Nmax];
int N,M,pi[Nmax],n,poz[1055];
void make_prefix()
{
    int q=0;
    pi[1]=0;
    for(int i=2;i<=N;i++)
    {
        while(q && A[q+1]!=A[i])q=pi[q];
        if(A[q+1]==A[i])q++;
        pi[i]=q;
    }
}
int main()
{
    freopen("strmatch.in", "r", stdin);
    freopen("strmatch.out", "w", stdout);
    fgets(A, sizeof(A),stdin);
    fgets(B, sizeof(B),stdin);
    for (; (A[N] >= 'A' && A[N] <= 'Z') || (A[N] >= 'a' && A[N] <= 'z')
            || (A[N] >= '0' && A[N] <= '9'); ++N);
    for (; (B[M] >= 'A' && B[M] <= 'Z') || (B[M] >= 'a' && B[M] <= 'z')
            || (B[M] >= '0' && B[M] <= '9'); ++M);
    for (int i = N; i; --i) A[i] = A[i-1]; A[0] = ' ';
    for (int i = M; i; --i) B[i] = B[i-1]; B[0] = ' ';
    make_prefix();
    int q=0;
    for(int i=1;i<=M;i++)
    {
        while(q && A[q+1]!=B[i])q=pi[q];
        if(A[q+1]==B[i])q++;
        if(q==N)
        {
            q=pi[N];
            n++;
            if(n<=1000)poz[n]=i-N;
        }
    }
    printf("%d\n", n);
    for (int i = 1; i <= minim(n, 1000); ++i)
        printf("%d ", poz[i]);
    printf("\n");
    return 0;
}