#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <algorithm>
using namespace std;

#define Nmax 2000010

int Pi[Nmax], N, M, Cnt, Sol[1010];
char A[Nmax], B[Nmax];

void Build_Prefix()
{
    int i, Q = 0;
    for(i = 2; i <= N; ++ i)
    {
        while(Q && A[i] != A[Q + 1]) Q = Pi[Q];
        if(A[i] == A[Q + 1]) Q ++;
        Pi[i] = Q;
    }
}

void Search()
{
    int i, Q = 0;
    for(i = 1; i <= M; ++ i)
    {
        while(Q && B[i] != A[Q + 1]) Q = Pi[Q];
        if(B[i] == A[Q + 1]) Q ++;
        if(Q == N)
        {
            Cnt ++;
            if(Cnt <= 1000) Sol[Cnt] = i - N;
        }
    }
}

int main()
{
    freopen("strmatch.in", "r", stdin);
    freopen("strmatch.out", "w", stdout);
    int i, j;
    gets(A + 1);
    N = strlen(A + 1);
    gets(B + 1);
    M = strlen(B + 1);
    Build_Prefix();
    Search();
    printf("%i\n", Cnt);
    for(i = 1; i <= min(Cnt, 1000); ++ i) printf("%i ", Sol[i]);
    return 0;
}