Vote

Benin holds a presidential election on 6 March 2016. Several candidates registered, and the national electoral commission, the CENA (Commission Nationale Electorale Autonome), runs the election.

Under Article 15 of the Beninese electoral code, the CENA prepares and organizes the election, supervises the voting, and centralizes the results.

Partial results arrive from the vote centers. Write a program that centralizes them and reports the winner of each election.

The first line contains the number of data sets $P$ ($1 \le P \le 1000$).

Each data set starts with a line containing the number of candidates $n$ ($1 \le n \le 100$) and the number of results to centralize $m$ ($1 \le m \le 1000$), separated by a space. The next $n$ lines contain the names of the candidates, one per line. The next $m$ lines each contain the name $X$ of a candidate, the result $R$ of that candidate, and the name $C$ of the vote center, separated by spaces.

$X$ and $C$ are strings without whitespace of at most 1000 characters. $R$ is an integer with $1 \le R \le 10^9$. Within one data set the candidate names are distinct and every $X$ is one of the $n$ candidates. The same candidate may appear in several result lines, one per vote center, and a candidate with no result line has the total 0.

Print one line for each data set. If exactly one candidate has the greatest total, print VOTE i: THE WINNER IS followed by the name of that candidate, a space, and that candidate's total. Otherwise print VOTE i: THERE IS A DILEMMA. Here $i$ is the number of the data set, counted from 1.