#include <cstdio>
#include <string>
#define nMax 2000000
using namespace std;

int Urm[nMax];
char T[nMax], P[nMax];
int n, m;

void next(char*);

int main() {

    int x = -1;

    freopen("strmatch.in", "r", stdin);
    freopen("strmatch.out", "w", stdout);

    fgets(P, nMax, stdin);
    fgets(T, nMax, stdin);

    n = strlen(T);
    m = strlen(P);

    next(P);

    int ans = 0;

    for(int i = 0; i < n; i++) {
        while (x > 0 && P[x + 1] != T[i])
            x = Urm[x];
        if (P[x + 1] == T[i])
            x++;
        if (x == m-1) {
            ans++;
            printf("%d ", i-m+1);
            x = Urm[x];
        }
    }

    return 0;
}

void next(char *P) {

    int k = -1;

    Urm[0] = 0;
    for (int x = 1; x < m; x++) {
        while (k > 0 && P[k + 1] != P[x])
            k = Urm[k];
        if (P[k + 1] == P[x])
            k++;
        Urm[x] = k;
    }

}