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

#define Nmax 2000010

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

void Build_Prefix()
{
    int i, Q = 0;
    Pi[1] = 0;
    for(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 Search()
{
    int i, Q = 0;
    for(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[Q];
            ++Sol[0];
            if(Sol[0] <= 1000) Sol[Sol[0]] = i - N;
        }
    }
}

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