B"Flowey has planted a bomb in Snowdin! The bomb has a timer that is initially set to b . Every second, the timer will decrease by 1 . When the timer reaches 0 , the bomb will explode! To give the residents of Snowdin enough time to evacuate, you will need to delay the bomb from exploding for as long as possible. You have n tools. Each tool can only be used at most once. If you use the i -th tool, the timer will increase by x_i . However, if the timer is changed to an integer larger than a , the timer will be set to a due to a bug. More specifically, the following events will happen every second in the following order: Jellyfish now wants to know the maximum time in seconds until the bomb explodes if the tools are used optimally. Each test contains multiple test cases. The first line contains the number of test cases t ( 1 <= q t <= q 2000 ). The description of the test cases follows. The first line of each test case contains three integers a , b and n ( 1 <= q b <= q a <= q 10^9 , 1 <= q n <= q 100 ) -- the maximum value of the bomb's timer, the initial value of the timer of the bomb and the number of tools. The second line of each test contains n integers x_1, x_2, ... , x_n ( 1 <= q x_i <= q 10^9 ) -- the number the timer can increase by using the i -th tool. Note that the sum of n over all test cases is not bounded. For each test case, output a single integer -- the maximum time in seconds until the bomb explodes. Let c denote the value of the bomb's timer. In the first test case: It can be proved that there is no way to use the tools such that the bomb explodes after more than 9 seconds. "...