Marathoner (Marathon Runner)

Input

The first line contains a positive integer $T$, representing the number of test cases, where T \leq 10. Each test case includes the following:

1. The first line contains a positive integer $K$ (1 < K \leq 100).

2. The second line lists the runner numbers of Bobby's $K$ friends, each a positive integer not exceeding $1000000$, separated by spaces.

3. The third line contains a positive integer $N$ (K < N \leq 1\,000).

4. The next $N$ lines provide details for each runner, one per line. Each line consists of three integers: the runner's ID (a positive integer not exceeding $1000000$), and the hours and minutes taken to finish the race. The minutes are a non-negative integer not exceeding $59$, and the hours are a non-negative integer not exceeding $23$. If a runner dropped out, both numbers will be $-1$.

Output

The output consists of $T$ lines, one for each test case. For each test case, output two numbers separated by a single space:

1. The first number is the runner ID of Bobby's friend with the best time.

2. The second number is the count of Bobby's friends who finished the race within $6$ hours (the maximum time to qualify for a prize is $6$ hours $0$ minutes).

Examples

Note

The input guarantees that at least one of Bobby's friends finishes within $6$ hours, and there is only one friend with the best time. Runner IDs are unique.