In a Chess match "a + b", each player has a clock which shows a minutes at the start and whenever a player makes a move, b seconds are added to this player's clock. Time on a player's clock decreases during that player's turns and remains unchanged during the other player's turns. If the time on some player's clock hits zero (but not only in this case), this player loses the game.
There's a 3 + 2 blitz chess match. After N turns (i.e. ⌊N+12⌋ moves made by white and ⌊N2⌋ moves made by black), the game ends and the clocks of the two players stop; they show that the players (white and black) have A and B seconds left respectively. Note that after the N-th turn, b=2 seconds are still added to the clock of the player that made the last move and then the game ends.
Find the total duration of the game, i.e. the number of seconds that have elapsed from the start of the game until the end.
The first line of the input contains a single integer T denoting the number of test cases. The description of T test cases follows. The first and only line of each test case contains three space-separated integers N, A and B.
For each test case, print a single line containing one integer — the duration of the game.
- 1≤T≤105
- 10≤N≤100
- 0≤A≤180+2⋅⌊N+12⌋
- 0≤B≤180+2⋅⌊N2⌋
- for N odd, A≥2
- for N even, B≥2
- there is at least one valid game consistent with the input
- 3
- 10 0 2
- 11 2 1
- 12 192 192
- 378
- 379
- 0