#include <bits/stdc++.h>
using namespace std;
#define rep(i,a,n) for (int i=a;i<n;i++)
#define per(i,a,n) for (int i=n-1;i>=a;i--)
#define pb push_back
#define eb emplace_back
#define mp make_pair
#define all(x) (x).begin(),(x).end()
#define fi first
#define se second
#define SZ(x) ((int)(x).size())
typedef vector<int> VI;
typedef basic_string<int> BI;
typedef long long ll;
typedef pair<int,int> PII;
typedef double db;
mt19937 mrand(random_device{}()); 
const ll mod=1000000007;
int rnd(int x) { return mrand() % x;}
ll powmod(ll a,ll b) {ll res=1;a%=mod; assert(b>=0); for(;b;b>>=1){if(b&1)res=res*a%mod;a=a*a%mod;}return res;}
ll gcd(ll a,ll b) { return b?gcd(b,a%b):a;}
// head

void rot(PII &a) {
	swap(a.fi,a.se);
	a.se=-a.se;
}
bool check(vector<PII> a,vector<PII> b) {
	sort(all(a));
	sort(all(b));
	PII ca,cb;
	auto chk=[&](int dx,int dy) {
		set<PII> s1;
		rep(i,0,SZ(a)) s1.insert(mp(a[i].fi+dx,a[i].se+dy));
		vector<PII> rb;
		rep(i,0,SZ(b)) {
			if (s1.count(b[i])) s1.erase(b[i]);
			else rb.pb(b[i]);
			if (SZ(rb)>=2) return false;
		}
		assert(SZ(rb)>=1);
		PII v=*s1.begin();
		ca=mp(v.fi-dx,v.se-dy);
		cb=mp(rb[0].fi-dx,rb[0].se-dy);
		return true;
	};
	rep(i,0,2) rep(j,0,2) {
		int dx=b[j].fi-a[i].fi,dy=b[j].se-a[i].se;
		if (chk(dx,dy)) {
			printf("%d %d\n",ca.se,ca.fi);
			printf("%d %d\n",cb.se,cb.fi);
			return true;
		}
	}
	return false;
}
int h1,w1,h2,w2;
vector<PII> p1,p2;
char s[11111];
int main() {
	scanf("%d%d",&h1,&w1);
	rep(i,0,h1) {
		scanf("%s",s);
		rep(j,0,w1) if (s[j]=='o') p1.pb(mp(i,j));
	}
	scanf("%d%d",&h2,&w2);
	rep(i,0,h2) {
		scanf("%s",s);
		rep(j,0,w2) if (s[j]=='o') p2.pb(mp(i,j));
	}
	rep(i,0,4) {
		if (check(p1,p2)) return 0;
		for (auto &p:p2) rot(p);
	}

}