There is a monster called lazyM in Rihamland who is the leader of this land. But another betrayer monster Arnab wants to kill lazyM. It is not easy to kill lazyM. He has n weak points and anyone can attack ith weak point at some particular time, but cannot attack more than one point at a time. To kill lazyM, Arnab needs to attack all the weak point of lazyM.
You will have the information of when lazyM’s ith weak point will appear and you need to find if Arnab can kill lazyM or not.
Input
Input starts with an integer T(1<=T<=10), denoting the number of test cases. 1st line of each case contains an integer n (1 ≤ n ≤ 8) donating the number of weak points of lazyM. Next n line contain Ai(1<= Ai <= 10^5) donating how many time ith (1 <= i <= n) week point will visible and followed by Ai positive integer donating visibility time (1 <= visibility time <= 10^5) of ith weak point.
Output
For each case of input, if Arnab can kill lazyM than print what would be the minimum time needed by Arnab to kill lazyM otherwise print “Arnab is weak”.
Sample
| Input | Output |
|---|---|
1 2 2 20 96 2 20 96 | 96 |
