Matchmaker

Description:

Input:

The first input line contains two space-separated integers n and m (1 ≤ n, m ≤ 10⁵) — the number of markers and the number of caps, correspondingly.

Next n lines describe the markers. The i-th line contains two space-separated integers x_i, y_i (1 ≤ x_i, y_i ≤ 1000) — the i-th marker's color and diameter, correspondingly.

Next m lines describe the caps. The j-th line contains two space-separated integers a_j, b_j (1 ≤ a_j, b_j ≤ 1000) — the color and diameter of the j-th cap, correspondingly.

Output:

Print two space-separated integers u, v, where u is the number of closed markers and v is the number of beautifully closed markers in the sought optimal way. Remember that you have to find the way to close the maximum number of markers, and if there are several such ways, you should choose the one where the number of beautifully closed markers is maximum.

Sample Input:

3 4
1 2
3 4
2 4
5 4
2 4
1 1
1 2

Sample Output:

3 2

Sample Input:

2 2
1 2
2 1
3 4
5 1

Sample Output:

1 0

Note:

In the first test sample the first marker should be closed by the fourth cap, the second marker should be closed by the first cap and the third marker should be closed by the second cap. Thus, three markers will be closed, and two of them will be beautifully closed — the first and the third markers.