#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define mp make_pair
#define inf (ll)1e18
#define pii pair <ll, ll>
#define fr first
#define se second
const ll mod = 1e9 + 7;
char buf[1 << 21], *p1 = buf, *p2 = buf;
#define getchar() (p1 == p2 && (p2 = (p1 = buf) + fread(buf, 1, 1 << 18, stdin), p1 == p2) ? EOF : *p1++)
inline ll read() {
	ll x = 0, f = 1;
	char ch = getchar();
	while(ch < '0' || ch > '9') f =((ch == '-') ? -1 : 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) x = -x, putchar('-');
	if(x >= 10) write(x / 10);
	putchar(x % 10 + '0');
}
const ll MAXN = 400005, MAXM = 4000005;
struct Flow {
	ll N, s, t;
	ll head[MAXN];
	struct Edge {
		ll v, e, c, nxt;
	}edge[MAXM];
	ll tag[MAXM], ti;
	ll tot = 1;
	void addedge(ll u, ll v, ll e, ll c) {
		edge[++tot].v = v;
		edge[tot].e = e;
		edge[tot].c = c;
		edge[tot].nxt = head[u];
		head[u] = tot;
	}
	void Addedge(ll u, ll v, ll e, ll c) {
		addedge(u, v, e, c);
		addedge(v, u, 0, -c);
	}
	ll vis[MAXN], cur[MAXN], dis[MAXN], dis2[MAXN];
	ll ans, anse;
	ll SPFA() {
		for(ll i = 0; i <= N; i++) cur[i] = head[i], vis[i] = 0, dis[i] = dis2[i] = inf;
		dis[s] = dis2[s] = 0, vis[s] = 1;
		queue <ll> Q;
		Q.push(s);
		while(!Q.empty()) {
			ll x = Q.front();
			Q.pop();
			vis[x] = 0;
			for(ll i = head[x]; i; i = edge[i].nxt) {
				ll y = edge[i].v, e = edge[i].e, c = edge[i].c;
				if(e && mp(dis[y], dis2[y]) > mp(dis[x] + c, dis2[x] + 1)) {
					dis[y] = dis[x] + c, dis2[y] = dis2[x] + 1;
					if(!vis[y]) {
						vis[y] = 1;
						Q.push(y);
					}
				} 
			}
		}
		ti++;
		for(ll i = 1; i <= N; i++) for(ll j = head[i]; j; j = edge[j].nxt) if(dis[edge[j].v] == dis[i] + edge[j].c) tag[j] = ti;
		return dis[t] != dis[0];
	}
	ll bfs() {
		for(ll i = 0; i <= N; i++) cur[i] = head[i], vis[i] = 0, dis2[i] = inf;
		dis2[s] = 0, vis[s] = 1;
		queue <ll> Q;
		Q.push(s);
		while(!Q.empty()) {
			ll x = Q.front();
			Q.pop();
			for(ll i = head[x]; i; i = edge[i].nxt) {
				ll y = edge[i].v, e = edge[i].e, c = edge[i].c;
				if(e && dis[y] == dis[x] + c && dis2[y] > dis2[x] + 1) {
					dis2[y] = dis2[x] + 1;
					if(!vis[y]) {
						vis[y] = 1;
						Q.push(y);
					}
				} 
			}
		}
		return dis2[t] != dis2[0];
	}
	ll dfs(ll u, ll E) {
		if(u == t) {
			ans += E;
			return E;
		}
		ll now = 0, used = 0;
		for(ll i = cur[u]; i; i = edge[i].nxt) {
			cur[u] = i;
			ll v = edge[i].v, e = edge[i].e, c = edge[i].c;
			if(tag[i] == ti && dis2[v] == dis2[u] + 1 && e) {
				now = dfs(v, min(E - used, e));
				if(now) {
					used += now;
					anse += c * now;
					edge[i].e -= now;
					edge[i^1].e += now;
					if(used == E) break;
				}
				else dis2[v] = inf;
			}
		}
		return used;
	}
	void Dinic() {
		while(SPFA()) {
			if(dis[t] >= 0) return ;
//			printf("HAHA %lld %lld\n", dis[t], dis2[t]);
			ll cnt = 0;
			while(bfs()) {
				cnt++;
				dfs(s, inf);
			}
//			printf("?? %lld\n", cnt);
//			printf("????\n");
		}
		
	} 	
}F;
ll n1, n2, m;
ll id1[100005][2], id2[100005][2];
signed main() {
    n1 = read(), n2 = read(), m = read();
    F.s = 1, F.t = F.N = 2;
    for(ll i = 1; i <= n1; i++) {
        id1[i][0] = ++F.N;
//        id1[i][1] = ++F.N;
        F.Addedge(F.s, id1[i][0], 1, -(ll)1e12);
        F.Addedge(F.s, id1[i][0], 1, (ll)1e6);
//        F.Addedge(id1[i][1], F.t, 1, 0);
    }
    for(ll i = 1; i <= n2; i++) {
        id2[i][0] = ++F.N;
//        id2[i][1] = ++F.N;
        F.Addedge(id2[i][0], F.t, 1, -(ll)1e12);
        F.Addedge(id2[i][0], F.t, 1, (ll)1e6);
//        F.Addedge(F.s, id2[i][1], 1, 0);
    }
    for(ll i = 1; i <= m; i++) {
        ll u = read(), v = read();
        F.Addedge(id1[u][0], id2[v][0], 1, 0);
//        F.Addedge(id1[u][1], id2[v][0], 1, (ll)1e6);
//        F.Addedge(id1[u][0], id2[v][1], 1, (ll)1e6);
    }
    F.Dinic();
    ll cut = (-F.anse + (ll)1e12 - 1) / (ll)1e12;
    ll ans1 = (n1 + n2) - cut, ans2 = (cut * (ll)1e12 + F.anse) / (ll)1e6;
    write(ans1), putchar(' '), write(ans2), putchar('\n');
	return 0;
}
/*
*/