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
#include <bits/stdc++.h>

using namespace std;

int V;  //  頂点数
const int MAX_V = 10001;
vector<int> G[MAX_V];  // グラフの隣接リスト表現
int match[MAX_V];      // マッチングのペア
bool used[MAX_V];      // DFS で既に調べたかのフラグ

// u と v を結ぶ辺をグラフに追加する
void add_edge(int u, int v) {
    G[u].push_back(v);
    G[v].push_back(u);
}

// 増加パスを DFSで探す
bool dfs(int v) {
    used[v] = true;
    for (int i = 0; i < G[v].size(); i++) {
        int u = G[v][i], w = match[u];
        if (w < 0 || !used[w] && dfs(w)) {
            match[v] = u;
            match[u] = v;
            return true;
        }
    }
    return false;
}

// 二部グラフの最大マッチングを求める
int bipartite_matching() {
    int res = 0;
    memset(match, -1, sizeof(match));
    //cout << "V:" << V << endl;
    for (int v = 0; v < V; v++) {
        //cout << "v:" << v << " match[v]:" << match[v] << endl;
        if (match[v] < 0) {
            memset(used, 0, sizeof(used));
            if (dfs(v)) {
                res++;
            }
        }
    }
    return res;
}

int main(int argc, char *argv[]) {
	int x, y, e;
	cin >> x >> y >> e;
    V = x + y;
	for (int i = 0; i < e; i++) {
	    int from, to;
	    cin >> from >> to;
	    add_edge(from, to + 1000);
	}
    cout << bipartite_matching() << endl;
    return 0;
}
