1
#include<bits/stdc++.h>
2
using namespace std;
3
typedef long long ll;
4
const ll N=1e5+10,M=1e2+50;
5
struct Node{ll x,y;}a[N],b[N];
6
ll n,m,i,j,pos,x,s,ans,f[M];
7
int main(){
8
 cin>>n>>m;
9
 for(i=1;i<=n;i++)cin>>a[i].x>>a[i].y;
10
 for(i=1;i<=m;i++)cin>>b[i].x>>b[i].y;
11
    stable_sort(a+1,a+1+n,[](Node x,Node y){return x.x!=y.x?x.x>y.x:x.y>y.y;});
12
    stable_sort(b+1,b+1+m,[](Node x,Node y){return x.x!=y.x?x.x>y.x:x.y>y.y;});
13
 for(i=1;i<=m;i++){
14
  for(j=pos+1;j<=n;j++)
15
   if(a[j].x>=b[i].x)f[a[j].y]+=1,pos=j;
16
   else break;
17
  for(x=b[i].y;x<=100;x++)
18
   if(f[x]){
19
    s++;ans+=b[i].x*500+b[i].y*2;f[x]--;
20
    break;
21
   }
22
 }
23
 cout<<s<<' '<<ans;
24
}