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 sys,queue,math,copy,itertools,bisect,collections,heapq

def main():
    LI = lambda : [int(x) for x in sys.stdin.readline().split()]

    X,Y,E = LI()

    edge = [set() for _ in range(X+Y+2)]

    for _ in range(E):
        a,b = LI()
        i = a + 1
        j = b + X + 1
        edge[i].add(j)
    for i in range(1,X+1):
        edge[0].add(i)
    for j in range(X+1,X+Y+1):
        edge[j].add(X+Y+1)

    ans = 0
    while True:
        node = [-2] * (X + Y + 2)
        node[0] = -1
        q = collections.deque()
        q.append(0)
        while q:
            u = q.pop()
            for v in edge[u]:
                if v == X + Y + 1:
                    ans += 1
                    node[v] = u
                    break
                if node[v] < -1:
                    node[v] = u
                    q.append(v)
            else:
                continue
            break
        else:
            break

        u = X + Y + 1
        while node[u] >= 0:
            edge[node[u]].remove(u)
            edge[u].add(node[u])
            u = node[u]


    print(ans)


if __name__ == '__main__':
    main()
