#include<bits/stdc++.h>
using namespace std;
int n1,n2,m;
int s,e,nxt[1200005],head[200005],go[1200005],flow[1200005],cost[1200005],k=1;
int dis[200005],now[200005],vis[200005];
int ans1,ans2;
void add(int u,int v,int fl,int w)
{
	nxt[++k]=head[u];
	head[u]=k;
	go[k]=v;
	flow[k]=fl;
	cost[k]=w;
}
void Add(int u,int v,int fl,int w)
{
	add(u,v,fl,w);
	add(v,u,0,-w);
}
int spfa()
{
	queue<int> q;
	memset(dis,0,sizeof(dis));
	memset(vis,0,sizeof(vis));
	q.emplace(s);
	vis[s]=1;
	while(!q.empty())
	{
		int x=q.front();
		q.pop();
		now[x]=head[x];
		vis[x]=0;
		for(int i=head[x];i;i=nxt[i])
		{
			int g=go[i];
			if(!flow[i]) continue ;
			if(dis[g]>dis[x]+cost[i])
			{
				dis[g]=dis[x]+cost[i];
				if(!vis[g])
				{
					vis[g]=1;
					q.emplace(g);
				}
			}
		}
	}
	return dis[e];
}
int dfs(int x,int fl)
{
	if(x==e) return fl;
	int res1=0,res2=0;
	vis[x]=1;
	for(int &i=now[x];i;i=nxt[i])
	{
		int g=go[i];
		if(!flow[i]||vis[g]||dis[g]!=dis[x]+cost[i]) continue ;
		res2=dfs(g,min(fl,flow[i]));
		res1+=res2;
		fl-=res2;
		flow[i]-=res2;
		flow[i^1]+=res2;
		if(!fl)
		{
			vis[x]=0;
			return res1;
		}
	}
	if(res1!=0) vis[x]=0;
	return res1;
}
int main()
{
	cin>>n1>>n2>>m;
	s=0,e=n1+n2+1;
	ans1=n1+n2;
	for(int i=1;i<=m;i++)
	{
		int u,v;
		cin>>u>>v;
		Add(u,v+n1,1,0);
	}
	for(int i=1;i<=n1;i++)
	{
		Add(s,i,1,-2*m);
		Add(s,i,1,-m);
	}
	for(int i=1;i<=n2;i++)
	{
		Add(i+n1,e,1,-2*m);
		Add(i+n1,e,1,-m);
	}
	while(1)
	{
		int w=spfa();
		if(w>=-2*m) break ;
		int fl=dfs(s,1e9);
		if(w==-4*m) ans1-=fl*2;
		if(w==-3*m) ans1-=fl,ans2+=fl;
	}
	cout<<ans1<<" "<<ans2<<"\n";
}