#include <bits/stdc++.h>

#define el '\n'
#define Beevo ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0);

typedef long long ll;
typedef long double ld;

using namespace std;

mt19937_64 rng(chrono::steady_clock::now().time_since_epoch().count());

void testCase() {
    int m, c;
    cin >> m >> c;

    int x, y;
    map<int, int> freqMX, freqMY;
    for (int i = 0; i < m; i++)
        cin >> x >> y, freqMX[x]++, freqMY[y]++;

    set<pair<int, int>> st;
    map<int, int> freqCX, freqCY;
    for (int i = 0; i < c; i++) {
        cin >> x >> y;

        if (max(freqMX[x], freqMY[y]) >= 2)
            continue;

        freqCX[x]++, freqCY[y]++, st.emplace(x, y);
    }

    x = y = 0;
    int mx = 0;
    for (auto &i: freqCX) {
        for (auto &j: freqCY) {
            int cnt = 0;

            if (freqMX[i.first] >= 1)
                cnt += i.second;

            if (freqMY[j.first] >= 1)
                cnt += j.second;

            if (freqMX[i.first] >= 1 && freqMY[j.first] >= 1)
                cnt -= st.count({i.first, j.first});

            if (cnt > mx)
                mx = cnt, x = i.first, y = j.first;
        }
    }

    cout << x << ' ' << y << el << mx;
}

signed main() {
    Beevo

    int t = 1;
//    cin >> t;

    while (t--)
        testCase();
}