#include <iostream>
#include<cstdio>
#include<algorithm>
#include<cstring>
using namespace std;
const int maxn=1e5+10;
struct node{
int time,level;
}ma[maxn],ta[maxn];
int c[105];
bool cmp(node a,node b){
if(a.time==b.time)return a.level>b.level;
return a.time>b.time;
}
int main()
{
//freopen("cin.txt","r",stdin);
int n,m;
while(cin>>n>>m){
memset(ma,0,sizeof(ma));
memset(ta,0,sizeof(ta));
int i,j,k;
for(i=0;i<n;i++)scanf("%d%d",&ma[i].time,&ma[i].level);
for(i=0;i<m;i++)scanf("%d%d",&ta[i].time,&ta[i].level);
sort(ma,ma+n,cmp);
sort(ta,ta+m,cmp);
memset(c,0,sizeof(c));
int cnt=0;
long long sum=0;
for(i=0,j=0;i<m;i++){ //不同的地方
while(j<n&&ma[j].time>=ta[i].time){
c[ma[j].level]++;
j++;
}
for(k=ta[i].level;k<=100;k++){
if(c[k]){
cnt++;
c[k]--;
sum=sum+500*ta[i].time+2*ta[i].level;
break;
}
}
}
printf("%d %I64d\n",cnt,sum);
}
return 0;
}