A bipartite graph G = (V, E) is a graph in which the vertex set V can be divided into two disjoint subsets X and Y such that every edge e ∈ E has one end point in X and the other end point in Y.

A matching M is a subset of edges such that each node in V appears in at most one edge in M.

Given a bipartite graph, find the size of the matching which has the largest size.

Constraints

* 1 ≤ |X|, |Y| ≤ 100
* 0 ≤ |E| ≤ 10,000

Input


|X| |Y| |E|
x0 y0
x1 y1
:
x|E|-1 y|E|-1


|X| and |Y| are the number of vertices in X and Y respectively, and |E| is the number of edges in the graph G. The vertices in X are named with the numbers 0, 1,..., |X|-1, and vertices in Y are named with the numbers 0, 1,..., |Y|-1, respectively.

xi and yi are the node numbers from X and Y respectevely which represent the end-points of the i-th edge.

Output

Print the largest size of the matching.

Example

Input

3 4 6
0 0
0 2
0 3
1 1
2 1
2 3


Output

3
// ?????§???????±??????? ?????§???????????????F??¨????????????O(F|E|) ?????????????????¨??????????????????:max_flow()
// ?????¬p.190
#include <algorithm>
#include <vector>
#include <cfloat>
#include <string>
#include <cmath>
#include <set>
#include <cstdlib>
#include <map>
#include <ctime>
#include <iomanip>
#include <functional>
#include <deque>
#include <iostream>
#include <cstring>
#include <queue>
#include <cstdio>
#include <stack>
#include <climits>
#include <sys/time.h>
#include <cctype>

using namespace std;

typedef long long ll;

#define INF INT_MAX
// ????????°????????§??°
#define MAX_V 100000
// ??°????????????????????°
int V;
// ??°?????????edge?????????????????¨????????????????????¨?????¨???
vector <int> graph[MAX_V];
int match[MAX_V];
bool vis[MAX_V];

// 
void add_edge(int u, int v) {
  graph[u].push_back(v);
  graph[v].push_back(u);
}

bool dfs(int v) {
  vis[v] = true;
  for (int i = 0; i < graph[v].size(); i++) {
    int u = graph[v][i], w = match[u];
    if (w < 0 || !vis[w] && dfs(w)) {
      match[v] = u;
      match[u] = v;
      return true;
    }
  }
  return false;
}

int bipartite_matching() {
  int ret = 0;
  memset(match, -1, sizeof(match));
  for (int v = 0; v < V; v++) {
    if (match[v] < 0) {
      memset(vis, false, sizeof(vis));
      if (dfs(v)) {
	ret++;
      }
    }
  }
  return ret;
}

int main() {
  int x, y, e;
  cin >> x >> y >> e;
  V = x+y;
  for (int i = 0; i < e; i++) {
    int s, t;
    cin >> s >> t;
    add_edge(s, x+t);
  }

  cout << bipartite_matching() << endl;
}