B"You are facing the final boss in your favorite video game. The boss enemy has h health. Your character has n attacks. The i 'th attack deals a_i damage to the boss but has a cooldown of c_i turns, meaning the next time you can use this attack is turn x + c_i if your current turn is x . Each turn, you can use all attacks that are not currently on cooldown, all at once. If all attacks are on cooldown, you do nothing for the turn and skip to the next turn. Initially, all attacks are not on cooldown. How many turns will you take to beat the boss? The boss is beaten when its health is 0 or less. The first line contains t ( 1 <= q t <= q 10^4 ) xe2 x80 x93 the number of test cases. The first line of each test case contains two integers h and n ( 1 <= q h, n <= q 2 cdot 10^5 ) xe2 x80 x93 the health of the boss and the number of attacks you have. The following line of each test case contains n integers a_1, a_2, ..., a_n ( 1 <= q a_i <= q 2 cdot 10^5 ) xe2 x80 x93 the damage of your attacks. The following line of each test case contains n integers c_1, c_2, ..., c_n ( 1 <= q c_i <= q 2 cdot 10^5 ) xe2 x80 x93 the cooldown of your attacks. It is guaranteed that the sum of h and n over all test cases does not exceed 2 cdot 10^5 . For each test case, output an integer, the minimum number of turns required to beat the boss. For the first test case, you can use attacks 1 and 2 on the first turn, dealing 3 damage in total, and slaying the boss. For the second case, you can beat the boss in 3 turns by using the following attacks: Turn 1 : Use attacks 1 and 2 , dealing 3 damage to the boss. The boss now has 2 health left. Turn 2 : Use attack 2 , dealing 1 damage to the boss. The boss now has 1 health left. Turn 3 : Use attack 1 , dealing 2 damage to the boss. The boss now has -1 h"...