#include<bits/stdc++.h>

using namespace std;

#define fi first
#define se second
#define mp make_pair
#define pb push_back
#define pf push_front
#define LC k<<1
#define RC k<<1|1
#define IO cin.sync_with_stdio(false); cin.tie(0); cout.tie(0);
#define all(x) (x).begin(), (x).end()
#define SZ(x) ((int)(x).size())
#define rep(i, a, n) for (int i = a; i < n; i++)
#define repn(i, a, n) for (int i = a; i <= n; i++)
#define per(i, a, n) for (int i = (n) - 1; i >= a; i--)
#define pern(i, a, n) for (int i = n; i >= a; i--)

typedef long long LL;
typedef long double LD;
typedef unsigned long long ull;
typedef pair<int, int> PII;
typedef pair<int, LL> PIL;
typedef pair<LL, int> PLI;
typedef pair<double, double> PDD;
typedef pair<ull, ull> PUU;
typedef pair<LL, LL> PLL;

const int N = 110000;
const int M = 1100000;
const int mod = 1e9+7;
const int inf = (int)1e9;
const LL INF = 1e18;
const double eps = 1e-9;

mt19937_64 Rand((unsigned long long)new char);
#define rand Rand

int n, m, na, nb;
vector<PII> a, b;
PII ans;
void print(int x1, int y1, int x2, int y2) {
	cout << x1 << " " << y1 << "\n";
	cout << x2 << " " << y2 << "\n";
	exit(0);
}
void work(int dx, int dy) {
	set<PII> S;
	for (auto p: b) S.insert(mp(p.fi + dx, p.se + dy));
	for (auto p: a) if (S.count(p)) S.erase(p); else ans = p;
	if (S.size() == 0) print(a[0].fi, a[0].se, a[0].fi, a[0].se);
	if (S.size() == 1) {
		auto it = S.begin();
		print(ans.fi, ans.se, it -> fi, it -> se);
	}
}
int main() {
	IO;
	cin >> n >> m;
	rep(i, 0, n) {
		string s;
		cin >> s;
		rep(j, 0, m) if (s[j] == 'o') a.pb(mp(j, i)), na++;
	}
	sort(all(a));
	cin >> n >> m;
	rep(i, 0, n) {
		string s;
		cin >> s;
		rep(j, 0, m) if (s[j] == 'o') b.pb(mp(j, i)), nb++;
	}
	sort(all(b));
	repn(rnd, 1, 4) {
		work(a[0].fi - b[0].fi, a[0].se - b[0].se);
		if (na > 1) {
			work(a[1].fi - b[0].fi, a[1].se - b[0].se);
			work(a[1].fi - b[1].fi, a[1].se - b[1].se);
			work(a[0].fi - b[1].fi, a[0].se - b[1].se);
		}
		rep(i, 0, SZ(b)) swap(b[i].fi, b[i].se), b[i].fi = -b[i].fi;
		sort(all(b));
	}
	return 0;
}