#include<bits/stdc++.h>
using namespace std;
#define int long long
const int N=2e5+5;
int x[N],y[N];
int fx[N],fy[N];
int w,h,n;
int maxn=-INT_MAX,minn=INT_MAX;
map<pair<int,int>,int>p;
int m,q;
signed main()
{
    cin>>w>>h;
    cin>>n;
    for(int i=1;i<=n;i++)
    {
        cin>>x[i]>>y[i];
    }
    int cnt=0;
    cin>>q;
    for(int i=1;i<=q;i++)   cin>>fx[i];
    q++;
    fx[q]=h;
    cin>>m;
    for(int i=1;i<=m;i++)   cin>>fy[i];
    m++;
    fy[m]=w;
    for(int i=1;i<=n;i++)
    {
        int kuaia=lower_bound(fx+1,fx+q+1,x[i])-fx;
        int kuaib=lower_bound(fy+1,fy+m+1,y[i])-fy;
        p[{kuaia,kuaib}]++;
        int now=p[{kuaia,kuaib}];
        if(now==1)  cnt++;
        maxn=max(now,maxn);
        minn=min(now,minn);
    }
    if(cnt==(q)*(m)){
        cout<<minn<<" "<<maxn<<endl;
    }
    else
        cout<<0<<" "<<maxn<<endl;

}

Wa*12