The stardate is 1983, and Princess Heidi is getting better at detecting the Death Stars. This time, two Rebel spies have yet again given Heidi two maps with the possible locations of the Death Star. Since she got rid of all double agents last time, she knows that both maps are correct, and indeed show the map of the solar system that contains the Death Star. However, this time the Empire has hidden the Death Star very well, and Heidi needs to find a place that appears on both maps in order to detect the Death Star.
The first map is an _N_ × _M_ grid, each cell of which shows some type of cosmic object that is present in the corresponding quadrant of space. The second map is an _M_ × _N_ grid. Heidi needs to align those two maps in such a way that they overlap over some _M_ × _M_ section in which all cosmic objects are identical. Help Heidi by identifying where such an _M_ × _M_ section lies within both maps.
## Input
The first line of the input contains two space-separated integers _N_ and _M_ (1 ≤ _N_ ≤ 2000, 1 ≤ _M_ ≤ 200, _M_ ≤ _N_). The next _N_ lines each contain _M_ lower-case Latin characters (_a_\-_z_), denoting the first map. Different characters correspond to different cosmic object types. The next _M_ lines each contain _N_ characters, describing the second map in the same format.
## Output
The only line of the output should contain two space-separated integers _i_ and _j_, denoting that the section of size _M_ × _M_ in the first map that starts at the _i_\-th row is equal to the section of the second map that starts at the _j_\-th column. Rows and columns are numbered starting from 1.
If there are several possible ways to align the maps, Heidi will be satisfied with any of those. It is guaranteed that a solution exists.
[samples]
## Note
The 5-by-5 grid for the first test case looks like this:
mayth
eforc
ebewi
thyou
hctwo
公元1983年，海迪公主在探测死星方面越来越得心应手。这一次，两名反抗军间谍再次给了海迪两张地图，标出了死星可能的位置。由于她上次已经清除了所有双面间谍，她知道这两张地图都是正确的，并且确实展示了包含死星的星系图。然而，这次帝国将死星藏得非常隐秘，海迪需要找到一个在两张地图上都出现的位置，以探测死星。
第一张地图是一个 #cf_span[N × M] 的网格，每个单元格显示对应空间区域中的某种宇宙物体。第二张地图是一个 #cf_span[M × N] 的网格。海迪需要将这两张地图对齐，使得它们在某个 #cf_span[M × M] 的重叠区域内所有宇宙物体完全相同。请帮助海迪找出这两张地图中这样的 #cf_span[M × M] 区域的位置。
输入的第一行包含两个用空格分隔的整数 #cf_span[N] 和 #cf_span[M]（#cf_span[1 ≤ N ≤ 2000]，#cf_span[1 ≤ M ≤ 200]，#cf_span[M ≤ N]）。接下来的 #cf_span[N] 行，每行包含 #cf_span[M] 个小写拉丁字母（_a_-_z_），表示第一张地图。不同的字符对应不同的宇宙物体类型。接下来的 #cf_span[M] 行，每行包含 #cf_span[N] 个字符，以相同格式描述第二张地图。
输出仅有一行，包含两个用空格分隔的整数 #cf_span[i] 和 #cf_span[j]，表示第一张地图中从第 #cf_span[i] 行开始的 #cf_span[M × M] 区域，与第二张地图中从第 #cf_span[j] 列开始的 #cf_span[M × M] 区域完全相同。行和列的编号从 1 开始。
如果存在多种对齐方式，海迪对其中任意一种都满意。保证解一定存在。
第一个测试用例的 5×5 网格如下所示：
## Input
输入的第一行包含两个用空格分隔的整数 #cf_span[N] 和 #cf_span[M]（#cf_span[1 ≤ N ≤ 2000]，#cf_span[1 ≤ M ≤ 200]，#cf_span[M ≤ N]）。接下来的 #cf_span[N] 行，每行包含 #cf_span[M] 个小写拉丁字母（_a_-_z_），表示第一张地图。不同的字符对应不同的宇宙物体类型。接下来的 #cf_span[M] 行，每行包含 #cf_span[N] 个字符，以相同格式描述第二张地图。
## Output
输出仅有一行，包含两个用空格分隔的整数 #cf_span[i] 和 #cf_span[j]，表示第一张地图中从第 #cf_span[i] 行开始的 #cf_span[M × M] 区域，与第二张地图中从第 #cf_span[j] 列开始的 #cf_span[M × M] 区域完全相同。行和列的编号从 1 开始。如果存在多种对齐方式，海迪对其中任意一种都满意。保证解一定存在。
[samples]
## Note
第一个测试用例的 5×5 网格如下所示：maytheforcebewithyouhctwo
**Definitions**
Let $ N, M \in \mathbb{Z} $ with $ 1 \leq M \leq N \leq 2000 $.
Let $ A \in \Sigma^{N \times M} $ be the first map, where $ \Sigma $ is the set of lowercase Latin letters.
Let $ B \in \Sigma^{M \times N} $ be the second map.
**Constraints**
1. $ 1 \leq M \leq N \leq 2000 $
2. $ A[i][j] \in \Sigma $ for all $ i \in \{1, \dots, N\}, j \in \{1, \dots, M\} $
3. $ B[i][j] \in \Sigma $ for all $ i \in \{1, \dots, M\}, j \in \{1, \dots, N\} $
4. There exists at least one pair $ (i, j) $ such that the $ M \times M $ subgrid of $ A $ starting at row $ i $ equals the $ M \times M $ subgrid of $ B $ starting at column $ j $.
**Objective**
Find integers $ i \in \{1, \dots, N - M + 1\} $, $ j \in \{1, \dots, N - M + 1\} $ such that:
$$
\forall r \in \{0, \dots, M-1\}, \forall c \in \{0, \dots, M-1\}, \quad A[i + r][1 + c] = B[1 + c][j + r]
$$
Output the pair $ (i, j) $.