#include <stdio.h>
#include <string.h>

#include <assert.h>

#include <vector>
#include <algorithm>

#define LOG(FMT...) fprintf(stderr, FMT)

#define eb emplace_back

using namespace std;

constexpr int N = 600005, M = 20000005, INF = 0x3f3f3f3f;

int n1, n2, m;
vector<int> adj[N];
int mat[N];

int S, T;
int h[N], e[M], ne[M], w[M], idx;
int d[N], cur[N], q[N], hh, tt;

void add(int x, int y, int c) {
	// LOG("%d ---%d--> %d\n", x, c, y);
	ne[++idx] = h[x], h[x] = idx, e[idx] = y, w[idx] = c;
	ne[++idx] = h[y], h[y] = idx, e[idx] = x, w[idx] = 0;
}

bool bfs() {
	memset(d, 0, T + 1 << 2);
	memcpy(cur, h, T + 1 << 2);
	d[S] = 1, *q = S, hh = tt = 0;
	while (hh <= tt) {
		int x = q[hh++];
		for (int i = h[x], y; i; i = ne[i]) {
			if (w[i] && !d[y = e[i]]) {
				d[y] = d[x] + 1;
				q[++tt] = y;
			}
		}
	}
	return d[T] > 0;
}

int find(int x, int limit) {
	if (x == T) {
		return limit;
	}
	int flow = 0, t;
	for (int i = cur[x], y; i && flow < limit; i = ne[i]) {
		y = e[i], cur[x] = i;
		if (d[y] == d[x] + 1 && w[i]) {
			t = find(y, min(limit - flow, w[i]));
			if (!t) d[y] = 0;
			w[i] -= t, w[i ^ 1] += t, flow += t;
		}
	}
	return flow;
}

int dinic() {
	int maxf = 0;
	while (bfs()) {
		maxf += find(S, INF);
	}
	return maxf;
}

int main() {
	scanf("%d%d%d", &n1, &n2, &m);
	S = 0, T = n1 + n2 + 1, idx = 1;
	for (int i = 0, x, y; i < m; ++i) {
		scanf("%d%d", &x, &y);
		add(x, y + n1, 1);
		adj[x].eb(y);
	}
	for (int x = 1; x <= n1; ++x) {
		add(S, x, 1);
	}
	for (int x = n1 + 1; x <= n1 + n2; ++x) {
		add(x, T, 1);
	}
	int maxmat = dinic();
	for (int x = 1; x <= n1; ++x) {
		for (int i = h[x]; i; i = ne[i]) {
			int y = e[i];
			if (w[i] || y == S) {
				continue;
			}
			assert(mat[x] == 0 && n1 < y && y <= n1 + n2);
			mat[x] = y, mat[y] = x;
			// LOG("%d <-> %d\n", x, y - n1);
		}
	}
	// LOG("---------------------\n");
	memset(h, 0, sizeof h), idx = 1;
	S = 0, T = 3 * (n1 + n2) + 1;
	for (int x = 1; x <= n1; ++x) {
		int y = mat[x];
		if (y) {
			add(x, y + n1 + n2, 2);
			add(y, x + n1 + n2, 2);
			add(x + n1 + n2, T, 1);
			add(y + n1 + n2, T, 1);
			for (int z : adj[x]) {
				if (!mat[z + n1]) {
					add(2 * (n1 + n2) + z + n1, x, 1);
				} else if (z != y - n1) {
					add(x + n1 + n2, z + n1, 1);
					add(z + n1 + n1 + n2, x, 1);
				}
			}
		} else {
			for (int z : adj[x]) {
				add(2 * (n1 + n2) + x, z + n1, 1);
			}
		}
	}
	for (int x = 1; x <= n1 + n2; ++x) {
		add(S, 2 * (n1 + n2) + x, 1);
	}
	int res3 = dinic();
	int res2 = maxmat - res3;
	int res1 = n1 + n2 - 2 * res2 - 3 * res3;
	printf("%d %d\n", res1, res3);
	return 0;
}