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

const int NMAX = 2000010;

int N, M, PI[NMAX];
char A[NMAX], B[NMAX];
vector<int> Pos;

void BuildPref()
{
    int Q = 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 FindMatches()
{
    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 && Pos.size() < 1000)
            Pos.push_back(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);

    BuildPref();
    FindMatches();

    printf("%i\n", Pos.size());
    for(int i = 0; i < Pos.size(); ++ i) printf("%i ", Pos[i]);
}