You've got two rectangular tables with sizes n_a × m_a and n_b × m_b cells. The tables consist of zeroes and ones. We will consider the rows and columns of both tables indexed starting from 1. Then we will define the element of the first table, located at the intersection of the i-th row and the j-th column, as a_i, j; we will define the element of the second table, located at the intersection of the i-th row and the j-th column, as b_i, j.

We will call the pair of integers (x, y) a shift of the second table relative to the first one. We'll call the overlap factor of the shift (x, y) value:

where the variables i, j take only such values, in which the expression a_i, j·b_{i + x, j + y} makes sense. More formally, inequalities 1 ≤ i ≤ n_a, 1 ≤ j ≤ m_a, 1 ≤ i + x ≤ n_b, 1 ≤ j + y ≤ m_b must hold. If there are no values of variables i, j, that satisfy the given inequalities, the value of the sum is considered equal to 0.

Your task is to find the shift with the maximum overlap factor among all possible shifts.

The first line contains two space-separated integers n_a, m_a (1 ≤ n_a, m_a ≤ 50) — the number of rows and columns in the first table. Then n_a lines contain m_a characters each — the elements of the first table. Each character is either a "0", or a "1".

The next line contains two space-separated integers n_b, m_b (1 ≤ n_b, m_b ≤ 50) — the number of rows and columns in the second table. Then follow the elements of the second table in the format, similar to the first table.

It is guaranteed that the first table has at least one number "1". It is guaranteed that the second table has at least one number "1".

Print two space-separated integers x, y (|x|, |y| ≤ 10⁹) — a shift with maximum overlap factor. If there are multiple solutions, print any of them.