#include<algorithm>
#include<bitset>
#include<cmath>
#include<cstdio>
#include<cstdlib>
#include<cstring>
#include<ctime>
#include<deque>
#include<fstream>
#include<iomanip>
#include<iostream>
#include<map>
#include<queue>
#include<set>
#include<stack>
#include<unordered_map>
#include<unordered_set>
#include<utility>
#include<vector>

using namespace std;

#ifdef HOME
const string inputFile = "input.txt";
const string outputFile = "output.txt";
#else
const string problemName = "strmatch";
const string inputFile = problemName + ".in";
const string outputFile = problemName + ".out";
#endif

const int NMAX = 2000000 + 5;

int N, M;
char A[NMAX];
char B[NMAX];
int pi[NMAX];
int nrP, P[1005];

void prefix() {
    int i, q = 0;

    for(i = 2; i <= N; i++) {
        while(A[i] != A[q + 1] && q)
            q = pi[q];

        if(A[i] == A[q + 1])
            q++;

        pi[i] = q;
    }
}

void kmp() {
    int i, q = 0;

    for(i = 1; i <= M; i++) {
        while(B[i] != A[q + 1] && q)
            q = pi[q];

        if(B[i] == A[q + 1])
            q++;

        if(q == N) {
            nrP++;
            if(nrP <= 1000)
                P[nrP] = i - N;
            q = pi[q];
        }
    }
}

int main() {
    int i;

#ifndef ONLINE_JUDGE
    freopen(inputFile.c_str(), "r", stdin);
    freopen(outputFile.c_str(), "w", stdout);
#endif

    scanf("%s", A + 1);
    scanf("%s", B + 1);

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

    prefix();
    kmp();

    printf("%d\n", nrP);

    for(i = 1; i <= min(nrP, 1000); i++)
        printf("%d ", P[i]);

    return 0;
}