#include <bits/stdc++.h>
#define all(v) begin(v),end(v)

using namespace std;

#ifdef CKISEKI
#define safe cerr<<__PRETTY_FUNCTION__<<" line "<<__LINE__<<" safe\n"
#define debug(a...) debug_(#a, a)
#define orange(a...) orange_(#a, a)
template <typename ...T>
void debug_(const char *s, T ... a) {
    cerr << "\e[1;32m(" << s << ") = (";
    int cnt = sizeof...(T);
    (..., (cerr << a << (--cnt ? ", " : ")\e[0m\n")));
}
template <typename I>
void orange_(const char *s, I L, I R) {
    cerr << "\e[1;32m[ " << s << " ] = [ ";
    for (int f = 0; L != R; ++L)
        cerr << (f++ ? ", " : "") << *L;
    cerr << " ]\e[0m\n";
}
#else
#define safe ((void)0)
#define debug(...) safe
#define orange(...) safe
#endif

template <typename T>
void sort_uni(vector<T> &v) {
    sort(v.begin(), v.end());
    v.erase(unique(v.begin(), v.end()), v.end());
}

pair<vector<int>,vector<int>> get_xy(vector<pair<int,int>> &A) {
    vector<int> X, Y;
    for (auto [x, y]: A)
        X.emplace_back(x), Y.emplace_back(y);
    sort_uni(X);
    sort_uni(Y);
    if (X.size() == 1)
        X.push_back(X[0]);
    if (Y.size() == 1)
        Y.push_back(Y[0]);
    return {X, Y};
}

pair<pair<int,int>, pair<int,int>> solve(vector<pair<int,int>> &A, vector<pair<int,int>> &B) {
    sort(A.begin(), A.end());
    sort(B.begin(), B.end());
    auto [ax, ay] = get_xy(A);
    auto [bx, by] = get_xy(B);

    vector<int> sx;
    vector<int> sy;
    for (int it = 0; it < 2; it++) {
        for (int x1: {ax[0], ax[1]})
            for (int x2: {bx[0], bx[1]})
                sx.emplace_back(x2 - x1);
        reverse(all(ax));
        reverse(all(bx));
    }
    for (int it = 0; it < 2; it++) {
        for (int y1: {ay[0], ay[1]})
            for (int y2: {by[0], by[1]})
                sy.emplace_back(y2 - y1);
        reverse(all(ay));
        reverse(all(by));
    }
    sort_uni(sx);
    sort_uni(sy);

    assert (A.size() == B.size());

    for (int dx: sx) {
        for (int dy: sy) {

            debug(dx, dy);
            for (auto &[x, y]: B) {
                x -= dx;
                y -= dy;
            }
            vector<pair<int,int>> t1, t2;
            set_difference(all(A), all(B), back_inserter(t1));
            set_difference(all(B), all(A), back_inserter(t2));
            if (t1.size() == 1 && t2.size() == 1) {
                for (auto [x, y]: A) debug(x, y, "A");
                for (auto [x, y]: B) debug(x, y, "B");
                debug(t1[0].first, t1[0].second);
                debug(t2[0].first, t2[0].second);
                debug(dx, dy, "ANS");
                return {t1[0], t2[0]};
            }
            if (t1.empty() && t2.empty()) {
                return {A[0], B[0]};
            }

            for (auto &[x, y]: B) {
                x += dx;
                y += dy;
            }
        }
    }
    
    return {{7122, 7122}, {7122, 7122}};
}

int main() {
    cin.tie(nullptr) -> sync_with_stdio(false);
    int h, w;
    cin >> h >> w;

    vector<pair<int,int>> A, B;

    for (int i = 0; i < h; i++) {
        string s;
        cin >> s;
        for (int j = 0; j < w; j++) {
            if (s[j] == 'o')
                A.emplace_back(i, j);
        }
    }
    
    cin >> h >> w;
    for (int i = 0; i < h; i++) {
        string s;
        cin >> s;
        for (int j = 0; j < w; j++) {
            if (s[j] == 'o')
                B.emplace_back(i, j);
        }
    }


    for (int rot = 0; rot < 4; rot++) {
        auto [p1, p2] = solve(A, B);
        if (p1.first != 7122) {
            auto [xa, ya] = p1;
            auto [xb, yb] = p2;
            cout << ya << ' ' << xa << '\n' << yb << ' ' << xb << '\n';
            return 0;
        }

        for (auto &[x, y]: B)
            tie(x, y) = make_pair(-y, x);
    }
}