Contests | Virtual Contests | Problems | Submit | Runs Status | Rank List | Forum |

Time Limit: 1.0 Seconds Memory Limit: 65536K

Total Runs: 113 Accepted Runs: 35

One day I was shopping in the supermarket. There was a cashier counting coins seriously when a little kid running and singing "门前大桥下游过一群鸭，快来快来数一数，二四六七八". And then the cashier put the counted coins back morosely and count again...

Hello Kiki is such a lovely girl that she loves doing counting in a different
way. For example, when she is counting *X* coins, she count them *N*
times. Each time she divide the coins into several same sized groups and write
down the group size *M _{i}* and the number of the remaining coins

One day Kiki's father found her note and he wanted to know how much coins Kiki was counting.

The first line is *T* indicating the number of test cases.

Each case contains *N* on the first line, *M _{i}* (1 ≤

All numbers in the input and output are integers.
1 ≤ *T* ≤ 100, 1 ≤ *N* ≤ 6, 1 ≤
*M _{i}* ≤ 50,
0 ≤

For each case output the least positive integer *X* which Kiki was
counting in the sample output format. If there is no solution then output -1.

2 2 14 57 5 56 5 19 54 40 24 80 11 2 36 20 76

Case 1: 341 Case 2: 5996

**Author: **digiter

Maintance:Fxz. Developer: SuperHacker, G.D.Retop, Fxz