Скоро день рождения Вашего сына (представьте что у Вас есть сын), и Вы ему пообещали устроить настоящий праздник. Он будет счастлив, если Вы сможете пригласить на праздник всех его друзей (а друзей у него много), но к сожалению пригласить всех Вы не можете, так как у Вас имеется ограниченное количество конфет, а Вы хотите осчастливить ими каждого приглашенного. As we all know, kids love to eat a lot of candies of the same type, let's say a kid will be happy only if he can eat at least \textbf{K} candies of the same type. Given \textbf{K}, and the number of available candies of each type, calculate the maximum number of kids where you can make all of them happy by giving each one at least K candies of the same type. \InputFile Your program will be tested on one or more test cases. The first line of the input will be a single integer \textbf{T}, the number of test cases (\textbf{1} ≤ \textbf{T} ≤ \textbf{100}). Followed by the test cases, each test case is on two lines. The first line of each test case contains two integers \textbf{N}, the number of dierent candies (\textbf{1} ≤ \textbf{N} ≤ \textbf{100}), and \textbf{K}, the minimum number of candies which will make a kid happy as described above (\textbf{1} ≤ \textbf{K} ≤ \textbf{100}). The second line of each test case contains \textbf{N} integers, separated by a single space, which are the available number of candies of each type. There will be at least \textbf{1} candy and at most \textbf{100} candies of each type. \OutputFile For each test case, print on a single line one integer, the maximum number of kids you are asked to calculate as described above.