Description

Input

Each test contains multiple test cases. The first line contains an integer $t$ ($1\le t\le 100$) — the number of test cases. The descriptions of the $t$ test cases follow.

The first line of each test case contains the integer $n$ ($1\le n\le 100$) — how many problems Gianni received from the judges.

The next $n$ lines contain two integers each. The $i$-th of such lines contains $b_i$ and $d_i$ ($1\le b_i, d_i\le 10$) — the beauty score and the difficulty of the $i$-th problem.

Output

For each test case, print the total beauty of the problem set chosen by Gianni. If Gianni cannot create a problem set (because there are no problems with a certain difficulty) print the string MOREPROBLEMS (all letters are uppercase, there are no spaces).

2
3
8 4
9 3
6 7
12
3 10
10 1
10 2
10 3
10 4
3 10
10 5
10 6
10 7
10 8
10 9
1 10
 
 
 
 

MOREPROBLEMS
93

Note

In the first test case, Gianni has received only $3$ problems, with difficulties $3, 4, 7$ which are not sufficient to create a problem set (for example because there is not a problem with difficulty $1$).

In the second test case, Gianni will create a problem set by taking the problems $2$, $3$, $4$, $5$, $7$, $8$, $9$, $10$, $11$ (which have beauty equal to $10$ and all difficulties from $1$ to $9$) and one of the problems $1$ and $6$ (which have both beauty $3$ and difficulty $10$). The total beauty of the resulting problem set is $10\cdot 9 + 3 = 93$.