#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ull = unsigned long long;
using ld = long double;
using i128 = __int128;
using u128 = unsigned __int128;
template <typename T>
void chkmax(T &x, const T &y) {
  if (x < y) x = y;
}
template <typename T>
void chkmin(T &x, const T &y) {
  if (y < x) x = y;
}
template <typename T1, typename T2>
pair<T1, T2> &operator+=(pair<T1, T2> &x, const pair<T1, T2> &y) {
  x.first += y.first;
  x.second += y.second;
  return x;
}
template <typename T1, typename T2>
pair<T1, T2> &operator+(pair<T1, T2> x, const pair<T1, T2> &y) {
  return x += y;
}
constexpr int INF = 0x3f3f3f3f;
namespace flow {
struct edge {
  int v, w, c, nxt;
};
constexpr int MAXNODE = 2e5 + 10, MAXEDGE = 6e5 + 10;
int n, s, t, head[MAXNODE], tot, qu[MAXNODE], hd, tl, dis[MAXNODE];
int cur[MAXNODE];
bool inq[MAXNODE], vis[MAXNODE];
edge e[MAXEDGE * 2];
void clear() {
  fill(head + 1, head + n + 1, -1);
  tot = 0;
}
void add_edge_base(int u, int v, int w, int c) {
  e[tot] = {v, w, c, head[u]};
  head[u] = tot++;
}
void add_edge(int u, int v, int w, int c) {
  add_edge_base(u, v, w, c);
  add_edge_base(v, u, 0, -c);
}
bool spfa() {
  fill(dis + 1, dis + n + 1, INF);
  copy(head + 1, head + n + 1, cur + 1);
  dis[s] = 0;
  qu[hd = 0] = s;
  tl = 1;
  while (hd != tl) {
    int u = qu[hd++];
    if (hd == MAXNODE) hd = 0;
    inq[u] = false;
    for (int i = head[u]; ~i; i = e[i].nxt) {
      int v = e[i].v, w = e[i].w, c = e[i].c;
      if (w && dis[u] + c < dis[v]) {
        dis[v] = dis[u] + c;
        if (!inq[v]) {
          qu[tl++] = v;
          if (tl == MAXNODE) tl = 0;
          inq[v] = true;
        }
      }
    }
  }
  return dis[t] < 0;
}
pair<int, int> dfs(int u, int f) {
  if (u == t) return {f, 0};
  pair<int, int> ret;
  vis[u] = true;
  for (int &i = cur[u]; ~i; i = e[i].nxt) {
    int v = e[i].v, w = e[i].w, c = e[i].c;
    if (w && dis[u] + c == dis[v] && !vis[v]) {
      pair<int, int> tmp = dfs(v, min(f - ret.first, w));
      e[i].w -= tmp.first;
      e[i ^ 1].w += tmp.first;
      ret += tmp;
      ret.second += tmp.first * c;
      if (ret.first == f) break;
    }
  }
  vis[u] = false;
  return ret;
}
pair<int, int> dinic() {
  pair<int, int> ret;
  while (spfa()) ret += dfs(s, INF);
  return ret;
}
}  // namespace flow
int n1, n2, m, tst0[flow::MAXNODE], tst2[flow::MAXNODE];
int main() {
  ios::sync_with_stdio(false);
  cin.tie(nullptr);
  cin >> n1 >> n2 >> m;
  flow::n = flow::t = n1 + n2 + 2;
  flow::s = flow::n - 1;
  flow::clear();
  for (int i = 1; i <= n1; ++i) {
    tst0[i] = flow::tot;
    flow::add_edge(flow::s, i, 1, -1);
    tst2[i] = flow::tot;
    flow::add_edge(flow::s, i, 1, 0);
  }
  for (int i = n1 + 1; i <= n1 + n2; ++i) {
    tst0[i] = flow::tot;
    flow::add_edge(i, flow::t, 1, -1);
    tst2[i] = flow::tot;
    flow::add_edge(i, flow::t, 1, 0);
  }
  while (m--) {
    int u, v;
    cin >> u >> v;
    flow::add_edge(u, v + n1, 1, 0);
  }
  flow::dinic();
  int ans0 = 0, ans2 = 0;
  for (int i = 1; i <= n1 + n2; ++i) {
    ans0 += flow::e[tst0[i]].w;
    ans2 += !flow::e[tst2[i]].w;
  }
  cout << ans0 << " " << ans2 << "\n";
  return 0;
}
/*
g++ G.cpp -o G -std=c++14 -O2 -Wall -Wextra -Wshadow -g
-fsanitize=address,undefined
*/