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

const int LMAX = 2000003;

int PI[LMAX], ans[LMAX];
char A[LMAX], B[LMAX];

int main () {

    freopen ("strmatch.in", "r", stdin);
    freopen ("strmatch.out", "w", stdout);
    int lA, lB, k = 0, i, a = 0;
    scanf ("%s%s", A + 1, B + 1);
    lA = strlen (A + 1);
    for (i = 2; i <= lA; ++i) {
        while (k && A[k + 1] != A[i])
            k = PI[k];
        if (A[k + 1] == A[i])
            ++k;
        PI[i] = k;
    }
    lB = strlen (B + 1);
    k = 0;
    for (i = 1; i <= lB; ++i) {
        while (k && A[k + 1] != B[i])
            k = PI[k];
        if (A[k + 1] == B[i])
            ++k;
        if (k == lA)
            ans[++a] = i - lA;
    }
    k = min (a, 1000);
    printf ("%d\n", a);
    for (i = 1; i <= k; ++i)
        printf ("%d ", ans[i]);

}