#pragma GCC optimize("Ofast")
#include <bits/stdc++.h>
using namespace std;
typedef long long int ll;

int main() {
    cin.tie(nullptr);
    ios::sync_with_stdio(false);
    int h,w; cin >> h >> w;
    vector<string> s(h);
    for (int i = 0; i < h; ++i) {
        cin >> s[i];
    }
    vector<pair<int,int>> coin;
    for (int i = 0; i < h; ++i) {
        for (int j = 0; j < w; ++j) {
            if(s[i][j] == 'o') coin.push_back({i,j});
        }
    }
    assert(coin.size() >= 2);
    int hh,ww; cin >> hh >> ww;
    vector<string> t(hh);
    for (int i = 0; i < hh; ++i) {
        cin >> t[i];
    }
    auto rotate = [](vector<string> t)->vector<string>{
        int h = t.size(), w = t[0].size();
        vector<string> res(w);
        for (int i = 0; i < w; ++i) {
            for (int j = 0; j < h; ++j) {
                res[w-1-i].push_back(t[j][i]);
            }
        }
        return res;
    };

    for (int i = 0; i < 4; ++i) {
        vector<pair<int,int>> v;
        set<pair<int,int>> st;
        for (int j = 0; j < t.size(); ++j) {
            for (int k = 0; k < t[0].size(); ++k) {
                if(t[j][k] == 'o') v.push_back({j,k});
            }
        }
        for (int j = 0; j < v.size(); ++j) {
            st.insert(v[j]);
        }
        // coin[0]
        {
            vector<pair<int,int>> base = {v[0], v[1]};
            for(auto p:base){
                auto cp = st;
                int dx = p.first-coin[0].first;
                int dy = p.second-coin[0].second;
                bool f = false;
                int bx,by;
                for(auto &q:coin){
                    int x = q.first+dx;
                    int y = q.second+dy;
                    if(cp.find({x,y}) == cp.end()){
                        if(f) break;
                        f = true;
                        bx = q.first, by = q.second;
                    }
                    else{
                        cp.erase(cp.find({x,y}));
                    }
                }
                if(cp.size() > 1) continue;
                auto po = *cp.begin();
                cout << by << " " << bx << endl;
                cout << po.second-dy << " " << po.first-dx << endl;
                return 0;
            }
        }
        // coin.back()
        {
            vector<pair<int,int>> base = {v[v.size()-1], v[v.size()-2]};
            for(auto p:base){
                auto cp = st;
                int dx = p.first-coin.back().first;
                int dy = p.second-coin.back().second;
                bool f = false;
                int bx,by;
                for(auto &q:coin){
                    int x = q.first+dx;
                    int y = q.second+dy;
                    if(cp.find({x,y}) == cp.end()){
                        if(f) break;
                        f = true;
                        bx = q.first, by = q.second;
                    }
                    else{
                        cp.erase(cp.find({x,y}));
                    }
                }
                if(cp.size() > 1) continue;
                auto po = *cp.begin();
                cout << by << " " << bx << endl;
                cout << po.second-dy << " " << po.first-dx << endl;
                return 0;
            }
        }
        t = rotate(t);
    }
}