A thief trying to escape from a jail has to cross N walls each with varying heights. He climbs X feet every time. But, due to the slippery nature of those walls, every times he slips back by Y feet. Now the task is to calculate the total number of jumps required to cross all walls and escape from the jail.
The first line of input contains an integer T denoting the no of test cases. Then T test cases follow. Each test case contains three space separated integers X, Y, N. Then in the next line are N space separated values denoting the heights ( Ht ) of the walls.
For each test case in a new line print the total number of jumps.
1<= N, X, Y <=100
1<= Ht <=1000
10 1 1
4 1 5
6 9 11 4 5
We strongly recommend solving this problem on your own before viewing its editorial. Do you still want to view the editorial?Yes