#include <iostream>
#include <cstdio>
#include <cstring>
#include <cstdlib>
#include <algorithm>
#include <queue>
#include <vector>
#include <stack>
#include <map>
#include <set>
#include <sstream>
#include <iomanip>
#include <cmath>
#include <bitset>
#include <assert.h>
#include <unordered_map>

using namespace std;
typedef long long ll;
typedef set<int>::iterator ssii;

#define Cmp(a, b) memcmp(a, b, sizeof(b))
#define Cpy(a, b) memcpy(a, b, sizeof(b))
#define Set(a, v) memset(a, v, sizeof(a))
#define debug(x) cout << #x << ": " << x << endl
#define _forS(i, l, r) for(set<int>::iterator i = (l); i != (r); i++)
#define _rep(i, l, r) for(int i = (l); i <= (r); i++)
#define _for(i, l, r) for(int i = (l); i < (r); i++)
#define _forDown(i, l, r) for(int i = (l); i >= r; i--)
#define debug_(ch, i) printf(#ch"[%d]: %d\n", i, ch[i])
#define debug_m(mp, p) printf(#mp"[%d]: %d\n", p->first, p->second)
#define debugS(str) cout << "dbg: " << str << endl;
#define debugArr(arr, x, y) _for(i, 0, x) { _for(j, 0, y) printf("%c", arr[i][j]); printf("\n"); }
#define _forPlus(i, l, d, r) for(int i = (l); i + d < (r); i++)
#define lowbit(i) (i & (-i))
#define MPR(a, b) make_pair(a, b)

pair<int, int> crack(int n) {
    int st = sqrt(n);
    int fac = n / st;
    while (n % st) {
        st += 1;
        fac = n / st;
    }

    return make_pair(st, fac);
}

inline ll qpow(ll a, int n) {
    ll ans = 1;
    for(; n; n >>= 1) {
        if(n & 1) ans *= 1ll * a;
        a *= a;
    }
    return ans;
}

template <class T>
inline bool chmax(T& a, T b) {
    if(a < b) {
        a = b;
        return true;
    }
    return false;
}

ll gcd(ll a, ll b) {
    return b == 0 ? a : gcd(b, a % b);
}

ll ksc(ll a, ll b, ll mod) {
    ll ans = 0;
    for(; b; b >>= 1) {
        if (b & 1) ans = (ans + a) % mod;
        a = (a * 2) % mod;
    }
    return ans;
}

ll ksm(ll a, ll b, ll mod) {
    ll ans = 1 % mod;
    a %= mod;

    for(; b; b >>= 1) {
        if (b & 1) ans = ksc(ans, a, mod);
        a = ksc(a, a, mod);
    }

    return ans;
}

template <class T>
inline bool chmin(T& a, T b) {
    if(a > b) {
        a = b;
        return true;
    }
    return false;
}

bool _check(int x) {
    //
    return true;
}

int bsearch1(int l, int r) {
    while (l < r) {
        int mid = (l + r) >> 1;
        if(_check(mid)) r = mid;
        else l = mid + 1;
    }
    return l;
}

int bsearch2(int l, int r) {
    while (l < r) {
        int mid = (l + r + 1) >> 1;
        if(_check(mid)) l = mid;
        else r = mid - 1;
    }
    return l;
}

template<class T>
bool lexSmaller(vector<T> a, vector<T> b) {
    int n = a.size(), m = b.size();
    int i;
    for(i = 0; i < n && i < m; i++) {
        if (a[i] < b[i]) return true;
        else if (b[i] < a[i]) return false;
    }
    return (i == n && i < m);
}

// ============================================================== //

const int maxn = 100000 + 10;
int n, m;
// m tasks  n machine

class A {
public:
    int x, y;
    bool operator< (const A &rhs) const {
        return x < rhs.x || (x == rhs.x && y < rhs.y);
    }
} T[maxn], M[maxn];

void solve() {
    sort(T, T+m);
    sort(M, M+n);
    multiset<int> st;

    ll ans = 0;
    ll cnt = 0;
    for (int i = m-1, j = n-1; i >= 0; i--) {
        while (j >= 0 && M[j].x >= T[i].x) st.insert(M[j--].y);
        auto it = lower_bound(st.begin(), st.end(), T[i].y);
        if (it != st.end()) {
            cnt++;
            ans += T[i].x * 500 + T[i].y * 2;
            st.erase(it);
        }
    }
    printf("%lld %lld\n", cnt, ans);
}

void init() {
    //
}

int main() {
    //freopen("input.txt", "r", stdin);
    init();

    scanf("%d%d", &n, &m);
    _for(i, 0, n) scanf("%d%d", &M[i].x, &M[i].y);
    _for(i, 0, m) scanf("%d%d", &T[i].x, &T[i].y);

    // then solve
    solve();
}