#include<bits/stdc++.h>
typedef long long ll;
typedef unsigned long long ull;
typedef long double ld;
#define pii pair<ll,ll>
#define rep(i,a,b) for(ll i=(a);i<=(b);++i)
#define per(i,a,b) for(ll i=(a);i>=(b);--i)
using namespace std;
bool Mbe;
inline ll read(){
	ll x=0,f=1;char ch=getchar();
	while(ch<'0'||ch>'9'){if(ch=='-')f=-f;ch=getchar();}
	while(ch>='0'&&ch<='9')x=x*10+ch-'0',ch=getchar();
	return x*f;
}
inline void write(ll x){
	if(x<0)putchar('-'),x=-x;
	if(x>9)write(x/10);
	putchar(x%10+'0');
}
const ll N=4e5+9,INF=1e9;
ll n1,n2,m,hd[N],tot=1,d[N],S,T,cur[N];
struct Edg{
	ll to,nxt,f,c;
}es[N<<2];
void adde(ll x,ll y,ll f,ll c){
	// cout<<x<<" "<<y<<" "<<f<<" "<<c<<endl;
	es[++tot]=(Edg){y,hd[x],f,c};
	hd[x]=tot;
	es[++tot]=(Edg){x,hd[y],0,c};
	hd[y]=tot;
}
bool bfs(ll msk){
	queue<ll>q;
	q.push(S);
	rep(i,0,T)d[i]=0;
	q.push(S),d[S]=1;
	while(!q.empty()){
		ll u=q.front();q.pop();
		for(ll i=hd[u];i;i=es[i].nxt){
			ll v=es[i].to,f=es[i].f,c=es[i].c;
			if((c&msk)==c&&!d[v]&&f){
				d[v]=d[u]+1;
				q.push(v);
				if(v==T)return 1;
			}
		}
	}
	return 0;
}
ll dinic(ll u,ll flow,ll msk){
	if(u==T)return flow;
	ll rst=flow;
	for(ll&i=cur[u];i;i=es[i].nxt){
		ll v=es[i].to,f=es[i].f,c=es[i].c;
		if(d[v]==d[u]+1&&f&&(c&msk)==c){
			ll k=dinic(v,min(rst,f),msk);
			if(!k)d[v]=0;
			rst-=k,es[i].f-=k,es[i^1].f+=k;
			if(!rst)return flow;
		}
	}
	return flow-rst;
}
void runflow(ll&res,ll msk){
	while(bfs(msk)){
		rep(i,0,T)cur[i]=hd[i];
		res+=dinic(S,INF,msk);
	}
}
bool Med;
int main(){
	cerr<<fabs(&Med-&Mbe)/1048576.0<<"MB\n";
	n1=read(),n2=read(),m=read();
	S=n1+n2+1,T=n1+n2+2;
	rep(i,1,n1)adde(S,i,1,0),adde(S,i,1,1);
	rep(i,n1+1,n1+n2)adde(i,T,1,0),adde(i,T,1,2);
	rep(i,1,m){
		ll x=read(),y=read();
		adde(x,y+n1,1,0);
	}
	ll ans1=0,ans2=0;
	runflow(ans1,0);
	runflow(ans2,1);
	runflow(ans2,2);
	write(n1+n2-ans1*2-ans2),putchar(' '),write(ans2);
	return 0;
}