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

const int NMAX = 2000003;

int PI[NMAX], R[NMAX], r;
char A[NMAX], B[NMAX];

inline void pattern_matching () {

    int N = strlen (A + 1), M = strlen (B + 1), k = 0, i;
    for (i = 2; i <= N; ++i) {
        while (k && A[k + 1] != A[i])
            k = PI[k];
        if (A[k + 1] == A[i])
            ++k;
        PI[i] = k;
    }
    k = 0;
    for (i = 1; i <= M; ++i) {
        while (k && A[k + 1] != B[i])
            k = PI[k];
        if (A[k + 1] == B[i])
            ++k;
        if (k == N)
            R[++r] = i - N;
    }

}

int main () {

    freopen ("strmatch.in", "r", stdin);
    freopen ("strmatch.out", "w", stdout);
    scanf ("%s%s", A + 1, B + 1);
    pattern_matching ();
    printf ("%d\n", r);
    r = min (r, 1000);
    for (int i = 1; i <= r; ++i)
        printf ("%d ", R[i]);

}