#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
#define X first
#define Y second
#define SZ(a) ((int)a.size())
#define pb push_back
#define ALL(v) v.begin(), v.end()

vector<pii> rd() {
    int h, w;
    cin >> h >> w;
    vector<pii> res;
    for (int i = 0; i < h; i++) {
        string s;
        cin >> s;
        for (int j =0 ; j < w; j++)
            if (s[j] == 'o')
                res.pb({j, i});
    }
    return res;
}

const int C = 2000;
int mp[2 * C][2 * C];

int main() {
    ios::sync_with_stdio(0), cin.tie(0);
    auto v1 = rd();
    auto v2 = rd();
    assert(SZ(v1) == SZ(v2));
    for (int kz = 0; kz < 4; kz++) {
        vector<int> x1, y1;
        for (auto [x, y] : v1)
            x1.pb(x), y1.pb(y);
        sort(ALL(x1));
        sort(ALL(y1));
        vector<int> x2, y2;
        for (auto [x, y] : v2)
            x2.pb(x), y2.pb(y);
        sort(ALL(x2));
        sort(ALL(y2));

        x1.resize(min(SZ(x1), 2));
        x2.resize(min(SZ(x2), 2));
        y1.resize(min(SZ(y1), 2));
        y2.resize(min(SZ(y2), 2));


        for (int a : x1)
            for (int b : x2)
                for (int c : y1)
                    for (int d : y2) {
                        int dx = b - a;
                        int dy = d - c;
                        vector<pii> mis;
                        vector<pii> cur;
                        for (auto [x, y] : v2)
                            mp[x + C][y + C] = 1;
                        for (auto [x, y] : v1) {
                            if (mp[x + dx + C][y + dy + C])
                                mp[x + dx + C][y + dy + C] = 0;         
                            else
                                mis.pb({x, y});
                        }
                        for (auto [x, y] : v2)
                            if (mp[x + C][y + C])
                                mp[x + C][y + C] = 0, cur.pb({x, y});
                        assert(SZ(cur) == SZ(mis));
                        if (SZ(cur) == 1) {
                            cout << mis[0].X << " " << mis[0].Y << "\n";
                            cout << cur[0].X - dx << " " << cur[0].Y - dy << "\n";
                            exit(0);
                        }
                    }

        for (auto &p : v2)
            p = {p.Y, -p.X};
    }
    assert(0);
}