#include<bits/stdc++.h>
#define ll long long
using namespace std;
int n,m,c,head[201000],to[20100000],cn=1,nxt[20010000],flow[20010000];ll val[20010000];
void ad(int u,int v,int f,ll w){
	to[++cn]=v,flow[cn]=f,nxt[cn]=head[u],val[cn]=w,head[u]=cn;
	to[++cn]=u,flow[cn]=0,nxt[cn]=head[v],val[cn]=-w,head[v]=cn;
}
const int I=1e9;
const ll I2=1e18;
int S,T;
int ans1;ll ans2;
ll d[201000];int di[201000];
bool vis[201000];
bool spfa(){
	for(int i=1;i<=T;i++)d[i]=I2,di[i]=0;
	d[S]=0;queue<int>q;q.push(S),vis[S]=1;
	while(!q.empty()){
		int u=q.front();q.pop(),vis[u]=0;
		for(int i=head[u];i;i=nxt[i])if(flow[i]&&d[to[i]]>d[u]+val[i]){
			d[to[i]]=d[u]+val[i];
			if(!vis[to[i]])vis[to[i]]=1,q.push(to[i]);
		}
	}
	q.push(S),di[S]=1;
	while(!q.empty()){
		int u=q.front();q.pop();
		for(int i=head[u];i;i=nxt[i])if(flow[i]&&!di[to[i]]&&d[to[i]]==d[u]+val[i]){
			di[to[i]]=di[u]+1;
			q.push(to[i]);
		}
	}
	return d[T]<0;
}
int dfs(int u,int in){
	if(u==T)return in;
	int out=0;
	for(int i=head[u];i&&in;i=nxt[i])if(flow[i]&&d[to[i]]==d[u]+val[i]&&di[to[i]]==di[u]+1){
		int p=dfs(to[i],min(in,flow[i]));
		ans2+=val[i]*p; 
		flow[i]-=p,flow[i^1]+=p;
		in-=p,out+=p;
	}
	return out;
}
int main(){
	scanf("%d%d%d",&n,&m,&c);
	S=n+m+1,T=S+1;
	for(int i=1;i<=n;i++)ad(S,i,1,-I),ad(S,i,1,1);
	for(int i=1;i<=m;i++)ad(i+n,T,1,-I),ad(i+n,T,1,1);
	for(int i=1,u,v;i<=c;i++){
		scanf("%d%d",&u,&v),v+=n;
		ad(u,v,1,0);
	}
	while(spfa())dfs(S,I);ans2=-ans2;
	printf("%lld %lld\n",n+m-(ans2+I-1)/I,(ans2+I-1)/I*I-ans2);
	return 0;
}