#include <bits/stdc++.h>

using namespace std;

int main(){
	ios_base::sync_with_stdio(0);
	cin.tie(0);
	int n1,n2,m1,m2;
	cin >> n1 >> n2;
	char in[n1][n2];
	for(int i = 0; i < n1; i++){
		for(int j = 0; j < n2; j++){
			char c;
			cin >> c;
			in[i][j] = c;
		}
	}
	cin >> m1 >> m2;
	char in1[m1][m2];
	unsigned long long ppow[m1][m2], seed = 13331,h[m1][m2], h1[m1][m2],hs = 0, ans = 0;
	ppow[0][0] = 1;
	for(int i = 0; i < m1; i++){
		for(int j = 0; j < m2; j++){
			char c;
			cin >> c;
			in1[i][j] = c;
			if(i && !j){
				ppow[i][j] = ppow[i-1][m2-1] * seed;
			}else if(j)ppow[i][j] = ppow[i][j-1] * seed;
			if(i)
				h[i][j] = h[i-1][j]+in1[i][j]*ppow[i][j];
			else h[0][j] = in1[0][j]*ppow[0][j];
			if(!j)h1[i][j] = h[i][j];
			else h1[i][j] = h1[i][j-1] + h[i][j];
		}
	}
	for(int i = 0; i < n1; i++){
		unsigned long long tmp = ppow[i][0];
		for(int j = 0; j < n2; j++){
			hs += in[i][j]*tmp;
			tmp *= seed;
		}
	}
	for(int i = 0; i+n1-1 < m1; i++){
		for(int j = 0; j+n2-1 < m2; j++){
			if(!i && !j){
				if(h1[i+n1-1][j+n2-1] == hs){ans++;cout << "(" << i+1 << "," << j+1 << ")" << endl;}
			}else if(!i && j){
				if(h1[i+n1-1][j+n2-1] - h1[i+n1-1][j-1] == ppow[i][j] * hs){ans++;cout << "(" << i+1 << "," << j+1 << ")" << endl;}
			}
			else if(i && !j){
				if(h1[i+n1-1][j+n2-1] - h1[i-1][j+n2-1] == ppow[i][j] * hs){ans++;cout << "(" << i+1 << "," << j+1 << ")" << endl;}
			}
			else {
				if(h1[i+n1-1][j+n2-1] - (h1[i-1][j+n2-1] + h1[i+n1-1][j-1] - h1[i-1][j-1]) == ppow[i][j] * hs){ans++;cout << "(" << i+1 << "," << j+1 << ")" << endl;}
			}
		}
	}
	if(ans == 0)cout << "NO MATCH FOUND..." << endl;
	return 0;
}