Ballot Evaluation

Before the 2009 European Parliament elections, Bill and Ted asked their friends to make guesses about the outcome of the ballot. Now that the results have been published, the two want to check whose guesses were right. Checking the guesses of their many friends by hand would take a very long time, so they want the evaluation done by a computer. Write a program that decides, for each guess, whether it is correct.

The first line contains the number of parties $p$ and the number of guesses $g$, separated by a space ($1 \le p \le 50$, $1 \le g \le 10000$).

The next $p$ lines each contain a unique party name followed by that party's achieved vote percentage. A party name has length at most 20 and consists only of letters (a-z, A-Z) and digits (0-9). The percentage is always given with exactly one digit after the decimal point.

The following $g$ lines each contain one guess of the form P1 + P2 + ... + Pk COMP n, where P1 through Pk are party names, COMP is one of the comparison operators <, >, <=, >=, =, and $n$ is an integer with $0 \le n \le 100$. Each party name occurs at most once within a single guess.

For each guess, add up the vote percentages of the parties that appear in it, then compare that sum with the integer $n$ using the given operator. For the $i$-th guess, print Guess #i was correct. on its own line if the guess holds, or Guess #i was incorrect. otherwise. Guesses are numbered starting from $1$ in the order they are given in the input.