B"You've got a job in a game studio that developed an online shooter, and your first big task is to help to balance weapons. The game has n weapons: the i -th gun has an integer fire rate f_i and an integer damage per bullet d_i . The i -th gun's total firepower is equal to p_i = f_i cdot d_i . You have to modify the values d_i of some guns in such a way that the new values d_i will still be integers, and the firepower of all guns will become balanced. Given an integer k , the guns are said to be balanced if max limits_{1 <= i <= n}{p_i} - min limits_{1 <= i <= n}{p_i} <= k . Since gamers that play your game don't like big changes, you need to change the values d_i for the minimum possible number of guns. What is the minimum number of guns for which you have to change these values to make the guns balanced? Note that the new values d_i must be integers greater than 0 . The first line contains a single integer t ( 1 <= t <= 1000 ) -- the number of test cases. The first line of each test case contains two integers n and k ( 2 <= n <= 3000 ; 0 <= k <= 1500 ) -- the number of guns to balance, and the maximum allowed gap between the most and the least powerful weapons. The second line contains n integers f_1, f_2, ... , f_n ( 1 <= f_i <= 2000 ), where f_i is the fire rate of the i -th gun. The third line contains n integers d_1, d_2, ... , d_n ( 1 <= d_i <= 10^9 ), where d_i is the damage per bullet of the i -th gun. It's guaranteed that the sum of n over all test cases doesn't exceed 3000 . For each test case, print the minimum number of guns which damage d_i you have to change in order to make the guns balanced. Note that the new values d_i must be integers greater than 0 . In the first test case, you can set d_1 = 2 and d_2 = 4 . You'll get an a"...