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 <cstdio>           // printf(), scanf()
#include <cstring>          // memset()
#include <vector>

using namespace std;
static const int MAX_V = 2 * 100;

vector<int> G[MAX_V];
int match[MAX_V];
bool used[MAX_V];
int V;

bool
dfs(int v)
{
	used[v] = true;
	for (unsigned 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));
	for (int v = 0; v < V; ++v)
	{
		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;
	int x, y;

	scanf("%d %d %d", &X, &Y, &E);
	V = X + Y;
	for (int i = 0; i < E; ++i)
	{
		scanf("%d %d", &x, &y);
		G[x].push_back(X + y);
		G[X + y].push_back(x);
	}

	printf("%d\n", bipartite_matching());
	return 0;
}