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
import java.io.BufferedReader;
import java.io.IOException;
import java.io.InputStream;
import java.io.InputStreamReader;
import java.util.ArrayList;
import java.util.Arrays;
import java.util.HashSet;
import java.util.StringTokenizer;

import java.util.Arrays;

public class Main {
		
	// ??????????????????????????????????????§?????¨??????????????°??? O(V*(V+E)) ??§?§£???
	// L <- ?????´?????????????????? : [0, L)
	public static int maximumBipartiteMatching(int L, ArrayList<HashSet<Integer>> adj){
		boolean[] visited = new boolean[adj.size()];
		int[] match = new int[adj.size()];
		Arrays.fill(match, -1);

		int count = 0;
		for(int curr = 0; curr < L; curr++){
			Arrays.fill(visited, false);

			if(augment(adj, curr, match, visited)){ count++; }
		}

		return count;
	}

	private static boolean augment(ArrayList<HashSet<Integer>> adj, int curr, int[] match, boolean[] visited) {
		if(curr < 0){return true; }

		for(final int next : adj.get(curr)) {
			if(visited[next]){ continue; }

			visited[next] = true;
			if(augment(adj, match[next], match, visited)) {
				match[curr] = next;
				match[next] = curr;
				return true;
			}
		}

		return false;
	}
		
	public static void main(String[] args){
		Scanner sc = new Scanner(System.in);
		
		final int X = sc.nextInt();
		final int Y = sc.nextInt();
		final int E = sc.nextInt();
		
		final int size = X + Y;
		ArrayList<HashSet<Integer>> adj = new ArrayList<HashSet<Integer>>();
		for(int i = 0; i < size; i++){ adj.add(new HashSet<Integer>()); }
		
		for(int i = 0; i < E; i++){
			final int x = sc.nextInt();
			final int y = sc.nextInt();
			
			adj.get(x).add(X + y);
		}
		
		System.out.println(maximumBipartiteMatching(X, adj));
	}
	
	public static class Scanner implements AutoCloseable {
		private BufferedReader br;
		private StringTokenizer tok;

		public Scanner(InputStream is) {
			br = new BufferedReader(new InputStreamReader(is));
		}

		private void getLine() {
			try {
				while (!hasNext()) {tok = new StringTokenizer(br.readLine());}
			} catch(IOException e){ /* ignore */ }
		}

		private boolean hasNext() {
			return tok != null && tok.hasMoreTokens();
		}

		public String next() {
			getLine(); return tok.nextToken();
		}

		public int nextInt(){
			return Integer.parseInt(next());
		}
		// ??????nextXXX???XXX.parseXXX()????????????????????£?????????????????§?????\

		public void close() {
			try{ br.close(); } catch (IOException e){ /*ignore*/ }
		}
	}
}