Its year 3000, and the voting system in Ajobdesh has changed to a new era. Instead of the boring old style voting, the new style voting is applied as follows:

1. Initially there are m male candidates and f female candidates for the parliament. For simplicity the male candidates are numbered as 'M₁', 'M₂' ... 'M_m' and the female candidates are numbered as 'F₁', 'F₂' ... 'F_f'.
2. There are v voters, and each of them can vote like 'P Q', which means, he wants to see P in the parliament and he wants Q to be thrown out of the parliament. For example, if a person voted like, 'M₃ F₇', that means he wants M₃ to be elected and F₇ to be thrown out.
3. The parliament will be formed in such a way that the maximum number of votes is satisfied. A voter, who voted 'P Q', is said to be satisfied if P is in the parliament and Q is not. For example, let the parliament be {M₁, M₃, F₃}, then voter who voted 'M₁ F₄' is satisfied but neither of 'M₁ F₃', 'F₃ M₃' or 'M₂ F₃' is satisfied.

Since Men don't want to see any Woman in the parliament, each man always votes like 'M_x F_y'. And Women don't want Men in the parliament, so each woman always votes like 'F_y M_x'. Assume that only Men and Women are eligible for voting.

Since you are the leading programmer in Ajobdesh, you have to form the parliament such that maximum number of voters is satisfied. Just report the maximum number of satisfied voters.

Input starts with an integer T (≤ 25), denoting the number of test cases.

Each case starts with a line containing three integers: m, f, v (1 ≤ m, f ≤ 100, 0 ≤ v ≤ 500). Each of the next v lines contains a vote either in the form 'M_x F_y' or 'F_y M_x' (1 ≤ x ≤ m, 1 ≤ y ≤ f).

For each case, print the case number and the maximum number of satisfied voters.