KMP

import java.util.*;

public class Main{
    public static void main(String[] args){
        
        Scanner sc = new Scanner(System.in);
        int n = sc.nextInt();
        String pp = sc.next();
        int m = sc.nextInt();
        String ss = sc.next();
        
        pp = " " + pp;//模式串
        ss = " " + ss;//原串
        
        char[] p = pp.toCharArray();
        char[] s = ss.toCharArray();
        
        int[] next = new int[p.length];
        //next数组存放的时模式串的信息
       	//next[i]代表模式串第i个字符匹配不成功时（前i-1个匹配成功）前i个字符里，前缀和后缀相等的最大长度
        //求next数组
        for(int i = 2,j = 0;i<=n;i++){
            while(j!=0 && p[i]!=p[j+1]) j = next[j];
            if(p[i] == p[j+1]) j++;
            next[i] = j;
        }
        
        
        //匹配
        
        for(int i = 1,j=0;i<=m;i++){
        //如果当前字符匹配不成功，模式串向后平移的最大距离是next[j]
            while(j!=0 && s[i]!=p[j+1]) j = next[j];
            if(s[i]==p[j+1]) j++;//当前位匹配成功，继续匹配
            //所有位匹配成功
            if(j==n) {
                System.out.print(i-n+" ");
                j = next[j];//原串可能包含多个模式串
            }
        }
        
    }
}