#include<iostream>
using namespace std;

const int N = 100010, M = 1000010;
int ne[N];
char p[N], s[M];
int n, m;

int main(){
    cin >> n >> p + 1 >> m >> s + 1;
    for(int i = 2, j = 0; i <= n; i ++){
        while(j && p[i] != p[j + 1]) j = ne[j];
        if(p[i] == p[j + 1]) j ++;
        ne[i] = j;
    }

    for(int i = 1, j = 0; i <= m; i ++){
        while(j && p[j + 1] != s[i]) j = ne[j];
        if(p[j + 1] == s[i]) j ++;

        if(j == n) printf("%d ", i - n);
    }
    return 0;
}