In the secretive world of espionage, forming the right task force can make the difference between mission success and failure. You are assigned as the head of a covert operations unit, and your task is to assemble as many task forces as possible from a pool of available agents. Each agent comes with a unique strength rating. A task force is valid if it contains at least one agent and, if the group consists of $k$ agents with the smallest strength being $s$, then the product $$s \times k$$ must be at least a specified threshold $x$. Note that an agent can be part of at most one task force, and it is not necessary to use every agent. Your goal is to determine the maximum number of valid task forces that can be formed given the strengths of the agents and the threshold $x$. ## Input Format The first line contains a single integer $T$ ($1 \le T \le 10^4$) denoting the number of test cases. Each test case is described by two lines: - The first line contains two space-separated integers $n$ and $x$ ($1 \le n \le 10^5$, $1 \le x \le 10^9$), where $n$ is the number of agents. - The second line contains $n$ space-separated integers $a_1, a_2, \ldots, a_n$ ($1 \le a_i \le 10^9$) representing the strength of each agent. It is guaranteed that the sum of all $n$ over all test cases does not exceed $10^5$. ## Output Format For each test case, print a single integer representing the maximum number of valid task forces that can be formed. ## Examples #### Input 5 10 7 11 2 9 5 #### Output 2 #### Input 4 8 2 4 2 3 #### Output 1