#pragma GCC optimize("Ofast,unroll-loops,inline")
#include<bits/stdc++.h>
#define ll long long
#define ld long double
#define pb push_back
#define endl '\n'
#define all(x) x.begin(),x.end()
#define pll pair<ll,ll>
#define open(name) if(fopen(name".inp", "r")){freopen(name".inp", "r", stdin); freopen(name".out", "w", stdout);}
using namespace std;
const int maxN=1e6+5;
const int mod=998244353;
const int base=311;
int n,m,w,h;
vector<pll> a,b;
void Rotate(){
    //-y x
    for(auto&[x,y]:b)y=-y,swap(x,y);
    sort(all(b));
}
bool check(ll dx,ll dy){
    set<pll> s;
    for(auto[x,y]:b)s.insert({x-dx,y-dy});
    pll r;
    for(auto[x,y]:a)
        if(s.find({x,y})!=s.end())s.erase({x,y});
        else r={x,y};
    if(s.size()>1)return 0;
    if(!s.size())cout<<a[0].first<<" "<<a[0].second<<endl<<a[0].first<<" "<<a[0].second;
    else cout<<r.first<<" "<<r.second<<endl<<(*s.begin()).first<<" "<<(*s.begin()).second;
    return 1;
}
void Enter(){
    cin>>n>>m;
    for(int i=0;i<n;i++){
        string s;cin>>s;
        for(int j=0;j<m;j++)if(s[j]=='o')a.pb({j,i});
    }
    cin>>w>>h;
    for(int i=0;i<w;i++){
        string s;cin>>s;
        for(int j=0;j<h;j++)if(s[j]=='o')b.pb({j,i});
    }
    sort(all(a));
    sort(all(b));
    for(int _=0;_<4;_++){
		for(int i=0;i<2;i++)for(int j=0;j<2;j++)if(check(b[i].first-a[j].first,b[i].second-a[j].second))return;
		Rotate();
	}
}
//amogus
signed main(){
    //open("tbrackets");
    cin.tie(nullptr);ios_base::sync_with_stdio(NULL);
    //int t=1;cin>>t;while(t--)
    Enter();
}