#include<bits/stdc++.h>
using namespace std;
using ll=long long;
using vl=vector<ll>;
using vvl=vector<vl>;
using P=pair<ll,ll>;
using vp=vector<P>;
using vvp=vector<vp>;
const int inf = 1e9;
#define rep2(i,j,k) for(ll i=ll(j);i<ll(k);i++)
#define rep(i,k) rep2(i,0,k)
#define rrep2(i,j,k) for(ll i=ll(j)-1;i>=ll(k);i--)
#define rrep(i,k) rrep2(i,k,0)
#define eb emplace_back
#define SZ(a) ll(a.size())
#define all(a) a.begin(),a.end()
template<class T>
bool chmin(T& a, T b){return a>b?a=b,1:0;}
template<class T>
bool chmax(T& a, T b){return a<b?a=b,1:0;}

int main(){
	cin.tie(0)->sync_with_stdio(0);
	vector<string> S, T;
	rep(_, 2) {
		int h, w;
		cin >> h >> w;
		S.resize(h);
		rep(i, h) cin >> S[i];
		swap(S, T);
	}
	auto out = [&](P a, P b, P ofs) {
		cout << a.second << ' ' << a.first << ' ' << b.second-ofs.second << ' ' << b.first-ofs.first << endl;
		exit(0);
	};
	auto d = [&](P a, P b) -> P {
		return P(b.first-a.first, b.second-a.second);
	};
	rep(rot, 4) {
		vp s, t;
		rep(i, SZ(S)) rep(j, SZ(S[0])) if(S[i][j] == 'o') s.eb(i, j);
		rep(i, SZ(T)) rep(j, SZ(T[0])) if(T[i][j] == 'o') t.eb(i, j);
		int n = SZ(s);
		assert(n >= 2 and SZ(t) == n);
		sort(all(s));
		sort(all(t));
		vp can;
		can.eb(d(s[0], t[0]));
		can.eb(d(s.back(), t.back()));
		can.eb(d(s[1], t[0]));
		can.eb(d(s[0], t[1]));
		for(auto p : can) {
			int l = 0;
			while(l < n and p == d(s[l], t[l])) ++l;
			int r = n;
			while(r and p == d(s[r-1], t[r-1])) --r;
			assert(l < r);
				{
					bool ok = true;
					rep2(i, l, r-1) ok &= d(s[i+1], t[i]) == p;
					if(ok) out(s[l], t[r-1], p);
				}
				{
					bool ok = true;
					rep2(i, l, r-1) ok &= d(s[i], t[i+1]) == p;
					if(ok) out(s[r-1], t[l], p);
				}
		}
		{
			int h = SZ(T);
			int w = SZ(T[0]);
			vector<string> nx(w, string(h,' '));
			rep(i, h) rep(j, w) nx[j][h-1-i] = T[i][j];
			swap(T, nx);
		}
	}
}