//Слава Україні, Героям слава

#include <bits/stdc++.h>

using namespace std;

const int N = 5e5 + 7, M = (1 << 20) + 1;

using vll = __int128_t;

long long binexp(long long a, long long n, int mod) {
    long long res = 1;
    while(n) {
        if(n & 1) {
            res = (res * a) % mod;
        }
        n >>= 1;
        a = (a * a) % mod;
    }
    return res;
}

namespace ntt {
    long long w[M], k, nrev;
    inline void init(int n, int root, int mod) {
        w[0] = 1;
        k = binexp(root, (mod - 1) / n, mod);
        nrev = binexp(n, mod - 2, mod);
        for(int i = 1; i <= n; i++) {
            w[i] = (w[i - 1] * k) % mod;
        }
    }
    inline void ntt(vector<long long> &a, int n, int mod, bool inv = false) {
        a.resize(n);
        for(int i = 0, j = 0; i < n; i++) {
            if(i > j) swap(a[i], a[j]);
            for(int l = n / 2; (j ^= l) < l; l >>= 1);
        }
        for(int i = 2; i <= n; i <<= 1) {
            for(int j = 0; j < n; j += i) {
                for(int l = 0; l < i / 2; l++) {
                    int x = j + l, y = j + l + (i / 2), z = (n / i) * l;
                    long long tmp = (a[y] * w[(inv ? (n - z) : z)]) % mod;
                    a[y] = (a[x] - tmp + mod) % mod;
                    a[x] = (a[j + l] + tmp) % mod;
                }
            }
        }
        if(inv) {
            for(int i = 0; i < n; i++) {
                a[i] = (a[i] * nrev) % mod;
            }
        }
    }
    vector<long long> multiply(vector<long long>& a, vector<long long>& b, int n, int root = 3, int mod = 998244353) {
        init(n, root, mod);
        ntt(a, n, mod);
        ntt(b, n, mod);
        vector<long long> ans(n);
        for(int i = 0; i < n; i++) {
            ans[i] = (a[i] * b[i]) % mod;
        }
        ntt(ans, n, mod, true);
        return ans;
    }
    vector<long long> multiply_crt2(vector<long long> &a, vector<long long> &b, long long mod) {
        vector<long long> primes = {1004535809, 998244353, 985661441};
        vector<long long> x[2], y[2], z[2];
        int n = a.size() + b.size() - 1;
        while(n & (n - 1)) n++;
        a.resize(n);
        b.resize(n);
        for(int p = 0; p < 2; p++) {
            x[p].resize(n);
            y[p].resize(n);
            for(int i = 0; i < n; i++) {
                x[p][i] = a[i] % primes[p];
                y[p][i] = b[i] % primes[p];
            }
        }
        for(int p = 0; p < 2; p++) {
            z[p] = multiply(x[p], y[p], n, 3, primes[p]);
        }
        vector<long long> ans(n);
        long long r01 = binexp(primes[0], primes[1] - 2, primes[1]);
        for(int i = 0; i < n; i++) {
            vll l = z[0][i], r = z[1][i];
            vll cur = ((r + primes[1] - l % primes[1]) % primes[1]) * r01 % primes[1];
            ans[i] = (l + (cur * primes[0]) % mod + mod) % mod;
        }
        return ans;
    }
}

int main() {
    ios_base::sync_with_stdio(false);
    cin.tie(nullptr);
    int n, m;
    cin >> n >> m;
    vector<long long> a(N), b(N), _a(N), _b(N);
    while(n--) {
        int x, y;
        cin >> x >> y;
        a[x] = y;
        _a[x] = 1;
    }
    while(m--) {
        int x, y;
        cin >> x >> y;
        b[x] = y;
        _b[x] = 1;
    }
    long long same = 0;
    for(int i = 0; i < N; i++) {
        if(_a[i] and _b[i]) {
            same += a[i] + b[i];
            a[i] = b[i] = 0;
        }
    }
    auto l = ntt::multiply_crt2(a, _b, (1ll << 61) - 1);
    auto r = ntt::multiply_crt2(b, _a, (1ll << 61) - 1);
    long long mx = 0;
    for(int i = 0; i < (int)min(l.size(), r.size()); i += 2) {
        mx = max(mx, (l[i] + r[i]));
    }
    cout << same + mx << "\n";
    return 0;
}