Problem:
Pattern Search

Find places where a R × C pattern is found within a H × W region. Print top-left coordinates (i, j) of sub-regions where the pattern found. The top-left and bottom-right coordinates of the region is (0, 0) and (H-1, W-1) respectively.

Input

In the first line, two integers H and W are given. In the following H lines, i-th lines of the region are given.

In the next line, two integers R and C are given. In the following R lines, i-th lines of the pattern are given.

output

For each sub-region found, print a coordinate i and j separated by a space character in a line. Print the coordinates in ascending order of the row numbers (i), or the column numbers (j) in case of a tie.

Constraints

1 ≤ H, W ≤ 1000

1 ≤ R, C ≤ 1000

The input consists of alphabetical characters and digits

Sample Input 1

4 5
00010
00101
00010
00100
3 2
10
01
10

Sample Output 1

0 3
1 2

Solution in Python3 (judge verdict: Time Limit Exceeded)

#coding:utf-8

def PS(A,B,H,W,R,C):
    for i in range(H):
        for j in range(W):
            if A[i][j]==B[0][0]:
                ans=0
                for k in range(R):
                    for l in range(C):
                        if i+k<H and j+l<W and A[i+k][j+l]==B[k][l]:
                            ans+=1
                if ans==R*C:
                    print(i,j)

if __name__=="__main__":
    H,W=map(int,input().split(" "))
    A=[]
    for i in range(H):
        A.append(list(input()))
    R,C=map(int,input().split(" "))
    B=[]
    for i in range(R):
        B.append(list(input()))
    PS(A,B,H,W,R,C)