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

const int NMAX = 2000010;

int N, M, PI[NMAX], Cnt, Sol[1010];
char A[NMAX], B[NMAX];

void Build_PI()
{
    int i, 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;
    }
}

void Find_Matches()
{
    int i, 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)
        {
            Cnt ++;
            if(Cnt <= 1000) Sol[Cnt] = i - N;
        }
    }
}

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

    gets(A + 1); N = strlen(A + 1);
    gets(B + 1); M = strlen(B + 1);

    Build_PI();
    Find_Matches();

    printf("%i\n", Cnt);
    for(int i = 1; i <= min(Cnt, 1000); ++ i)
        printf("%i ", Sol[i]);
}