There are $n$ programmers that you want to split into several non-empty teams. The skill of the $i$-th programmer is $a_i$. You want to assemble the maximum number of teams from them. There is a restriction for each team: the number of programmers in the team multiplied by the minimum skill among all programmers in the team must be at least $x$.

Each programmer should belong to at most one team. Some programmers may be left without a team.

Calculate the maximum number of teams that you can assemble.


-----Input-----

The first line contains the integer $t$ ($1 \le t \le 1000$) — the number of test cases.

The first line of each test case contains two integers $n$ and $x$ ($1 \le n \le 10^5; 1 \le x \le 10^9$) — the number of programmers and the restriction of team skill respectively.

The second line of each test case contains $n$ integers $a_1, a_2, \dots , a_n$ ($1 \le a_i \le 10^9$), where $a_i$ is the skill of the $i$-th programmer.

The sum of $n$ over all inputs does not exceed $10^5$.


-----Output-----

For each test case print one integer — the maximum number of teams that you can assemble. 


-----Example-----
Input
3
5 10
7 11 2 9 5
4 8
2 4 2 3
4 11
1 3 3 7

Output
2
1
0

```python

USER_FILENAME = "<user_code>"
import sys, json, builtins
import math, heapq, bisect, itertools, functools, collections, statistics, fractions, decimal, operator, array, random, re, string, os, pathlib
try:
    import resource as _res
except Exception:
    _res = None
from collections import Counter, defaultdict, deque, OrderedDict
from functools import lru_cache, reduce
from itertools import accumulate, permutations, combinations, product
from math import gcd, ceil, floor, sqrt
from decimal import Decimal
try:
    from typing import *
except Exception:
    pass
try:
    sys.setrecursionlimit(1_000_000)
except Exception:
    pass
try:
    import site as _site
    try:
        _sys_sites = _site.getsitepackages() if hasattr(_site, "getsitepackages") else []
        for _p in _sys_sites:
            if _p and _p not in sys.path:
                sys.path.append(_p)
    except Exception:
        pass
    try:
        _usp = _site.getusersitepackages()
        if isinstance(_usp, str):
            _usp = [_usp]
        for _p in _usp:
            if _p and _p not in sys.path:
                sys.path.append(_p)
    except Exception:
        pass
except Exception:
    pass

ns = {"__name__": "__main__"}
for _k, _v in list(globals().items()):
    if not _k.startswith("_"):
        ns[_k] = _v
_CODE = 'import math \nfrom collections import deque\nimport sys\n\n\nsys.setrecursionlimit(10**4) \n\ndef Divisors(n) : \n\t\n\tl=[]\n\ti = 2\n\twhile i <= math.sqrt(n): \n\t\t\n\t\tif (n % i == 0) : \n\t\t\t\n\t\t\t\n\t\t\tif (n // i == i) : \n\t\t\t\tl.append(i)\n\t\t\telse : \n\t\t\t\tl.append(i)\n\t\t\t\tl.append(n//i)\n\t\ti = i + 1\n\treturn l\n\ndef SieveOfEratosthenes(n): \n\t\n\tl=[]\n\t\n\tprime = [True for i in range(n+1)] \n\tp = 2\n\twhile (p * p <= n): \n\t\t\n\t\tif (prime[p] == True): \n\t\t\t\n\t\t\tfor i in range(p * p, n+1, p): \n\t\t\t\tprime[i] = False\n\t\tp += 1\n\t\n\tfor p in range(2, n+1): \n\t\tif prime[p]: \n\t\t\tl.append(p)\n\t\n\treturn l\t\t\n\ndef primeFactors(n): \n\t\n\tl=[]\n\t\n\twhile n % 2 == 0: \n\t\tl.append(2) \n\t\tn = n / 2\n\t\t\n\tfor i in range(3,int(math.sqrt(n))+1,2): \n\t\t\n\t\twhile n % i== 0: \n\t\t\tl.append(i) \n\t\t\tn = n / i \n\t\t\t\n\tif n > 2: \n\t\tl.append(n)\n\t\n\treturn(l)\t\n\t\t\n\ndef Factors(n) : \n\t\n\t\n\tresult = []\n\t\n\tfor i in range(2,(int)(math.sqrt(n))+1) : \n\n\t\tif (n % i == 0) : \n\t\t    \n\t\t\tif (i == (n/i)) : \n\t\t\t\tresult.append(i)\n\t\t\telse : \n\t\t\t    result.append(i)\n\t\t\t    result.append(n//i)\n\t\t\n\tresult.append(1)\n\t\n\treturn result\n\ndef maxSubArraySum(a): \n\t\n\tmax_so_far = 0\n\tmax_ending_here = 0\n\tsize=len(a)\n\t\n\tfor i in range(0, size): \n\t\tmax_ending_here = max_ending_here + a[i] \n\t\tif (max_so_far < abs(max_ending_here)): \n\t\t\tmax_so_far = max_ending_here \n\n\treturn max_so_far \n\ndef longestsubarray(arr, n, k): \n    current_count = 0\n      \n    # this will contain length of  \n    # longest subarray found \n    max_count = 0\n  \n    for i in range(0, n, 1): \n        if (arr[i] % k != 0): \n            current_count += 1\n        else: \n            current_count = 0\n        max_count = max(current_count,  \n                            max_count) \n      \n    return max_count \n    \n#print(SieveOfEratosthenes(100))\n#print(Divisors(100))\n#print(primeFactors(100))\n#print(Factors(100))\n#print(maxSubArraySum(a))\n \n\ndef main():\n    \n    n,x=list(map(int,input().split()))\n    l=list(map(int,input().split()))\n    l.sort()\n    c=1\n    ans=0\n    for j in range(len(l)-1,-1,-1):\n        if l[j]*c >=x:\n            ans+=1\n            c=1\n        else:\n            c+=1\n            \n    print(ans)\n        \n    \n    \n          \nt=int(input())\nfor i in range(0,t):\n    main()'
_co = compile(_CODE, USER_FILENAME, "exec")
exec(_co, ns, ns)

```

Measured memory_bytes: 14495