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

Source: codeforces | Difficulty: MEDIUM
Tags: Sorting

Implementation

Greedy algorithms

Complete search

Dynamic programming


Solutions:
for _ in range(int(input())):
	(n, x) = map(int, input().split())
	l = list(map(int, input().split()))
	l.sort(reverse=True)
	size = 1
	team = 0
	for i in range(n):
		if l[i] * size >= x:
			team += 1
			size = 1
		else:
			size += 1
	print(team)


for _ in range(int(input())):
	(n, x) = [int(a) for a in input().split()]
	progs = [int(a) for a in input().split()]
	progs.sort()
	progs = reversed(progs)
	ans = 0
	tsize = 0
	for p in progs:
		tsize += 1
		score = tsize * p
		if score >= x:
			tsize = 0
			ans += 1
	print(ans)


input = __import__('sys').stdin.readline
for _ in range(int(input())):
	(n, x) = map(int, input().split())
	s = sorted(map(int, input().split()), reverse=True)
	i = ans = 0
	c = 1
	while i < n:
		if c * s[i] >= x:
			ans += 1
			c = 1
		else:
			c += 1
		i += 1
	print(ans)


from collections import Counter, defaultdict, deque
import sys
input = sys.stdin.readline

def solve():
	(n, x) = [int(x) for x in input().split()]
	arr = [int(x) for x in input().split()]
	arr.sort(reverse=True)
	ans = 0
	i = 0
	s = 0
	c = 0
	for i in range(n):
		c += 1
		if arr[i] * c >= x:
			c = 0
			ans += 1
	print(ans)
tt = int(input())
for test in range(tt):
	solve()


for _ in range(int(input())):
	(x, y) = map(int, input().split())
	(*li,) = map(int, input().split())
	li.sort(reverse=True)
	(cnt, ans) = (0, 0)
	for i in range(x):
		min1 = li[i]
		cnt += 1
		if min1 * cnt >= y:
			ans += 1
			cnt = 0
	print(ans)


import sys
import math
from collections import defaultdict, Counter
t = int(input())
for i in range(t):
	(n, x) = map(int, input().split())
	a = list(map(int, input().split()))
	a.sort(reverse=True)
	ans = 0
	c = 1
	for j in range(n):
		if c * a[j] >= x:
			ans += 1
			c = 1
		else:
			c += 1
	print(ans)


t = int(input())
for i in range(t):
	(n, x) = map(int, input().split())
	a = list(map(int, input().split()))
	a.sort(reverse=True)
	count = 0
	ans = 0
	for j in range(n):
		count += 1
		if count * a[j] >= x:
			ans += 1
			count = 0
	print(ans)


t = int(input())
while t:
	t = t - 1
	(n, x) = map(int, input().split())
	a = list(map(int, input().split()))
	cnt = 0
	a.sort(reverse=True)
	i = 0
	while 1:
		if i == n:
			break
		if a[i] >= x:
			cnt += 1
			i += 1
			continue
		pro = a[i]
		j = 1
		i += 1
		while pro < x and i < n:
			j += 1
			pro = a[i] * j
			i += 1
		if pro >= x:
			cnt += 1
	print(cnt)


for _ in range(int(input())):
	(n, x) = map(int, input().split())
	arr = list(map(int, input().split()))
	arr = sorted(arr)
	team = 0
	for i in arr[::-1]:
		if i >= x:
			team += 1
			n -= 1
		else:
			break
	start = n - 1
	if arr[n - 1] * n < x:
		print(team)
		continue
	while start > -1:
		stop = -1
		people = 0
		for i in range(start, -1, -1):
			people += 1
			if people * arr[i] >= x:
				team += 1
				start = i - 1
				stop = 0
				people = 0
		if stop == -1:
			start -= 1
	print(team)


import sys
input = sys.stdin.readline
Q = int(input())
for _ in range(Q):
	(N, X) = map(int, input().split())
	A = list(map(int, input().split()))
	A.sort(reverse=True)
	ans = 0
	count = 1
	for a in A:
		if count * a >= X:
			ans += 1
			count = 0
		count += 1
	print(ans)


import os
import sys
from io import BytesIO, IOBase
BUFSIZE = 8192

class FastIO(IOBase):
	newlines = 0

	def __init__(self, file):
		self._fd = file.fileno()
		self.buffer = BytesIO()
		self.writable = 'x' in file.mode or 'r' not in file.mode
		self.write = self.buffer.write if self.writable else None

	def read(self):
		while True:
			b = os.read(self._fd, max(os.fstat(self._fd).st_size, BUFSIZE))
			if not b:
				break
			ptr = self.buffer.tell()
			(self.buffer.seek(0, 2), self.buffer.write(b), self.buffer.seek(ptr))
		self.newlines = 0
		return self.buffer.read()

	def readline(self):
		while self.newlines == 0:
			b = os.read(self._fd, max(os.fstat(self._fd).st_size, BUFSIZE))
			self.newlines = b.count(b'\n') + (not b)
			ptr = self.buffer.tell()
			(self.buffer.seek(0, 2), self.buffer.write(b), self.buffer.seek(ptr))
		self.newlines -= 1
		return self.buffer.readline()

	def flush(self):
		if self.writable:
			os.write(self._fd, self.buffer.getvalue())
			(self.buffer.truncate(0), self.buffer.seek(0))

class IOWrapper(IOBase):

	def __init__(self, file):
		self.buffer = FastIO(file)
		self.flush = self.buffer.flush
		self.writable = self.buffer.writable
		self.write = lambda s: self.buffer.write(s.encode('ascii'))
		self.read = lambda : self.buffer.read().decode('ascii')
		self.readline = lambda : self.buffer.readline().decode('ascii')
(sys.stdin, sys.stdout) = (IOWrapper(sys.stdin), IOWrapper(sys.stdout))
input = lambda : sys.stdin.readline().rstrip('\r\n')
from collections import Counter
import math
for _ in range(int(input())):
	(n, k) = map(int, input().split())
	arr = list(map(int, input().split()))
	arr.sort()
	cnt = 0
	f = 0
	for i in range(n):
		if arr[i] >= k:
			cnt += 1
		elif f == 1:
			if var == 1:
				cnt += 1
			if math.ceil(k / arr[i]) < var or var == 0:
				var = math.ceil(k / arr[i]) - 1
			else:
				var -= 1
		else:
			var = math.ceil(k / arr[i])
			var -= 1
			f = 1
			if var == 0:
				cnt += 1
	print(cnt)


import math

def main():
	for _ in range(int(input())):
		(n, x) = map(int, input().split())
		a = list(map(int, input().split()))
		a.sort()
		l = [math.ceil(x / i) for i in a]
		i = n - 1
		(s, j) = (0, 0)
		while i > -1 and l:
			temp = l[-1]
			while j < temp and l:
				j += 1
				l.pop()
				i -= 1
				if l and j != temp:
					temp = l[-1]
			if j == temp:
				s += 1
			j = 0
		print(s)
main()


def solve():
	(n, x) = [int(v) for v in input().split()]
	arr = sorted([int(v) for v in input().split()])
	r = n - 1
	groups = 0
	start = n - 1
	while r >= 0:
		if (start - r + 1) * arr[r] >= x:
			groups += 1
			start = r - 1
		r -= 1
	print(groups)
t = int(input())
for _ in range(t):
	solve()


from sys import stdin, stdout
T = int(stdin.readline())
for iT in range(T):
	(n, x) = [int(i) for i in stdin.readline().split(' ') if i]
	a = [int(i) for i in stdin.readline().split(' ') if i]
	a.sort(reverse=True)
	k = 0
	m = 0
	for i in a:
		m += 1
		if m * i >= x:
			k += 1
			m = 0
	stdout.write(f'{k}\n')


for _ in range(int(input())):
	(n, x) = map(int, input().split())
	a = list(map(int, input().split()))
	a.sort()
	k = n - 1
	c = 0
	cnt = 0
	while k > -1:
		if a[k] * (c + 1) >= x:
			cnt += 1
			c = 0
		else:
			c += 1
		k -= 1
	print(cnt)


import sys
input = sys.stdin.readline
import math
for _ in range(int(input())):
	c = 1
	res = 0
	(n, x) = list(map(int, input().split()))
	z = list(map(int, input().split()))
	z.sort(reverse=True)
	for i in z:
		if i * c >= x:
			c = 0
			res += 1
		c += 1
	print(res)


t = int(input())
for v in range(t):
	(n, k) = map(int, input().split())
	li = list(map(int, input().split()))
	li.sort(reverse=True)
	count = 1
	ans = 0
	for i in range(n):
		if count * li[i] >= k:
			ans += 1
			count = 1
		else:
			count += 1
	print(ans)


for t in range(int(input())):
	(n, k) = map(int, input().split())
	a = list(map(int, input().split()))
	a.sort()
	c = 0
	ans = 0
	for i in range(n - 1, -1, -1):
		c += 1
		if a[i] * c >= k:
			c = 0
			ans += 1
	print(ans)


import os
import sys
from io import BytesIO, IOBase
from collections import Counter, defaultdict
BUFSIZE = 8192

class FastIO(IOBase):
	newlines = 0

	def __init__(self, file):
		self._fd = file.fileno()
		self.buffer = BytesIO()
		self.writable = 'x' in file.mode or 'r' not in file.mode
		self.write = self.buffer.write if self.writable else None

	def read(self):
		while True:
			b = os.read(self._fd, max(os.fstat(self._fd).st_size, BUFSIZE))
			if not b:
				break
			ptr = self.buffer.tell()
			(self.buffer.seek(0, 2), self.buffer.write(b), self.buffer.seek(ptr))
		self.newlines = 0
		return self.buffer.read()

	def readline(self):
		while self.newlines == 0:
			b = os.read(self._fd, max(os.fstat(self._fd).st_size, BUFSIZE))
			self.newlines = b.count(b'\n') + (not b)
			ptr = self.buffer.tell()
			(self.buffer.seek(0, 2), self.buffer.write(b), self.buffer.seek(ptr))
		self.newlines -= 1
		return self.buffer.readline()

	def flush(self):
		if self.writable:
			os.write(self._fd, self.buffer.getvalue())
			(self.buffer.truncate(0), self.buffer.seek(0))

class IOWrapper(IOBase):

	def __init__(self, file):
		self.buffer = FastIO(file)
		self.flush = self.buffer.flush
		self.writable = self.buffer.writable
		self.write = lambda s: self.buffer.write(s.encode('ascii'))
		self.read = lambda : self.buffer.read().decode('ascii')
		self.readline = lambda : self.buffer.readline().decode('ascii')
(sys.stdin, sys.stdout) = (IOWrapper(sys.stdin), IOWrapper(sys.stdout))
input = lambda : sys.stdin.readline().rstrip('\r\n')
primes = [2, 3, 5, 7, 11, 13, 17, 19, 23, 29, 31, 37, 41, 43, 47, 53, 59, 61, 67, 71, 73, 79, 83, 89, 97, 101, 103, 107, 109, 113, 127, 131, 137, 139, 149, 151, 157, 163, 167, 173, 179, 181, 191, 193, 197, 199, 211, 223, 227, 229, 233, 239, 241, 251, 257, 263, 269, 271, 277, 281, 283, 293, 307, 311, 313, 317, 331, 337, 347, 349, 353, 359, 367, 373, 379, 383, 389, 397, 401, 409, 419, 421, 431, 433, 439, 443, 449, 457, 461, 463, 467, 479, 487, 491, 499, 503, 509, 521, 523, 541, 547, 557, 563, 569, 571, 577, 587, 593, 599, 601, 607, 613, 617, 619, 631, 641, 643, 647, 653, 659, 661, 673, 677, 683, 691, 701, 709, 719, 727, 733, 739, 743, 751, 757, 761, 769, 773, 787, 797, 809, 811, 821, 823, 827, 829, 839, 853, 857, 859, 863, 877, 881, 883, 887, 907, 911, 919, 929, 937, 941, 947, 953, 967, 971, 977, 983, 991, 997, 1009, 1013, 1019, 1021, 1031, 1033, 1039, 1049, 1051, 1061, 1063, 1069, 1087, 1091, 1093, 1097, 1103, 1109, 1117, 1123, 1129, 1151, 1153, 1163, 1171, 1181, 1187, 1193, 1201, 1213, 1217, 1223, 1229, 1231, 1237, 1249, 1259, 1277, 1279, 1283, 1289, 1291, 1297, 1301, 1303, 1307, 1319, 1321, 1327, 1361, 1367, 1373, 1381, 1399, 1409, 1423, 1427, 1429, 1433, 1439, 1447, 1451, 1453, 1459, 1471, 1481, 1483, 1487, 1489, 1493, 1499, 1511, 1523, 1531, 1543, 1549, 1553, 1559, 1567, 1571, 1579, 1583, 1597, 1601, 1607, 1609, 1613, 1619, 1621, 1627, 1637, 1657, 1663, 1667, 1669, 1693, 1697, 1699, 1709, 1721, 1723, 1733, 1741, 1747, 1753, 1759, 1777, 1783, 1787, 1789, 1801, 1811, 1823, 1831, 1847, 1861, 1867, 1871, 1873, 1877, 1879, 1889, 1901, 1907, 1913, 1931, 1933, 1949, 1951, 1973, 1979, 1987, 1993, 1997, 1999, 2003, 2011, 2017, 2027, 2029, 2039, 2053, 2063, 2069, 2081, 2083, 2087, 2089, 2099, 2111, 2113, 2129, 2131, 2137, 2141, 2143, 2153, 2161, 2179, 2203, 2207, 2213, 2221, 2237, 2239, 2243, 2251, 2267, 2269, 2273, 2281, 2287, 2293, 2297, 2309, 2311, 2333, 2339, 2341, 2347, 2351, 2357, 2371, 2377, 2381, 2383, 2389, 2393, 2399, 2411, 2417, 2423, 2437, 2441, 2447, 2459, 2467, 2473, 2477, 2503, 2521, 2531, 2539, 2543, 2549, 2551, 2557, 2579, 2591, 2593, 2609, 2617, 2621, 2633, 2647, 2657, 2659, 2663, 2671, 2677, 2683, 2687, 2689, 2693, 2699, 2707, 2711, 2713, 2719, 2729, 2731, 2741, 2749, 2753, 2767, 2777, 2789, 2791, 2797, 2801, 2803, 2819, 2833, 2837, 2843, 2851, 2857, 2861, 2879, 2887, 2897, 2903, 2909, 2917, 2927, 2939, 2953, 2957, 2963, 2969, 2971, 2999, 3001, 3011, 3019, 3023, 3037, 3041, 3049, 3061, 3067, 3079, 3083, 3089, 3109, 3119, 3121, 3137, 3163, 3167, 3169, 3181, 3187, 3191, 3203, 3209, 3217, 3221, 3229, 3251, 3253, 3257, 3259, 3271, 3299, 3301, 3307, 3313, 3319, 3323, 3329, 3331, 3343, 3347, 3359, 3361, 3371, 3373, 3389, 3391, 3407, 3413, 3433, 3449, 3457, 3461, 3463, 3467, 3469, 3491, 3499, 3511, 3517, 3527, 3529, 3533, 3539, 3541, 3547, 3557, 3559, 3571, 3581, 3583, 3593, 3607, 3613, 3617, 3623, 3631, 3637, 3643, 3659, 3671, 3673, 3677, 3691, 3697, 3701, 3709, 3719, 3727, 3733, 3739, 3761, 3767, 3769, 3779, 3793, 3797, 3803, 3821, 3823, 3833, 3847, 3851, 3853, 3863, 3877, 3881, 3889, 3907, 3911, 3917, 3919, 3923, 3929, 3931, 3943, 3947, 3967, 3989, 4001, 4003, 4007, 4013, 4019, 4021, 4027, 4049, 4051, 4057, 4073, 4079, 4091, 4093, 4099, 4111, 4127, 4129, 4133, 4139, 4153, 4157, 4159, 4177, 4201, 4211, 4217, 4219, 4229, 4231, 4241, 4243, 4253, 4259, 4261, 4271, 4273, 4283, 4289, 4297, 4327, 4337, 4339, 4349, 4357, 4363, 4373, 4391, 4397, 4409, 4421, 4423, 4441, 4447, 4451, 4457, 4463, 4481, 4483, 4493, 4507, 4513, 4517, 4519, 4523, 4547, 4549, 4561, 4567, 4583, 4591, 4597, 4603, 4621, 4637, 4639, 4643, 4649, 4651, 4657, 4663, 4673, 4679, 4691, 4703, 4721, 4723, 4729, 4733, 4751, 4759, 4783, 4787, 4789, 4793, 4799, 4801, 4813, 4817, 4831, 4861, 4871, 4877, 4889, 4903, 4909, 4919, 4931, 4933, 4937, 4943, 4951, 4957, 4967, 4969, 4973, 4987, 4993, 4999, 5003, 5009, 5011, 5021, 5023, 5039, 5051, 5059, 5077, 5081, 5087, 5099, 5101, 5107, 5113, 5119, 5147, 5153, 5167, 5171, 5179, 5189, 5197, 5209, 5227, 5231, 5233, 5237, 5261, 5273, 5279, 5281, 5297, 5303, 5309, 5323, 5333, 5347, 5351, 5381, 5387, 5393, 5399, 5407, 5413, 5417, 5419, 5431, 5437, 5441, 5443, 5449, 5471, 5477, 5479, 5483, 5501, 5503, 5507, 5519, 5521, 5527, 5531, 5557, 5563, 5569, 5573, 5581, 5591, 5623, 5639, 5641, 5647, 5651, 5653, 5657, 5659, 5669, 5683, 5689, 5693, 5701, 5711, 5717, 5737, 5741, 5743, 5749, 5779, 5783, 5791, 5801, 5807, 5813, 5821, 5827, 5839, 5843, 5849, 5851, 5857, 5861, 5867, 5869, 5879, 5881, 5897, 5903, 5923, 5927, 5939, 5953, 5981, 5987, 6007, 6011, 6029, 6037, 6043, 6047, 6053, 6067, 6073, 6079, 6089, 6091, 6101, 6113, 6121, 6131, 6133, 6143, 6151, 6163, 6173, 6197, 6199, 6203, 6211, 6217, 6221, 6229, 6247, 6257, 6263, 6269, 6271, 6277, 6287, 6299, 6301, 6311, 6317, 6323, 6329, 6337, 6343, 6353, 6359, 6361, 6367, 6373, 6379, 6389, 6397, 6421, 6427, 6449, 6451, 6469, 6473, 6481, 6491, 6521, 6529, 6547, 6551, 6553, 6563, 6569, 6571, 6577, 6581, 6599, 6607, 6619, 6637, 6653, 6659, 6661, 6673, 6679, 6689, 6691, 6701, 6703, 6709, 6719, 6733, 6737, 6761, 6763, 6779, 6781, 6791, 6793, 6803, 6823, 6827, 6829, 6833, 6841, 6857, 6863, 6869, 6871, 6883, 6899, 6907, 6911, 6917, 6947, 6949, 6959, 6961, 6967, 6971, 6977, 6983, 6991, 6997, 7001, 7013, 7019, 7027, 7039, 7043, 7057, 7069, 7079, 7103, 7109, 7121, 7127, 7129, 7151, 7159, 7177, 7187, 7193, 7207, 7211, 7213, 7219, 7229, 7237, 7243, 7247, 7253, 7283, 7297, 7307, 7309, 7321, 7331, 7333, 7349, 7351, 7369, 7393, 7411, 7417, 7433, 7451, 7457, 7459, 7477, 7481, 7487, 7489, 7499, 7507, 7517, 7523, 7529, 7537, 7541, 7547, 7549, 7559, 7561, 7573, 7577, 7583, 7589, 7591, 7603, 7607, 7621, 7639, 7643, 7649, 7669, 7673, 7681, 7687, 7691, 7699, 7703, 7717, 7723, 7727, 7741, 7753, 7757, 7759, 7789, 7793, 7817, 7823, 7829, 7841, 7853, 7867, 7873, 7877, 7879, 7883, 7901, 7907, 7919]
from math import ceil

def lmii():
	return list(map(int, input().split()))
t = int(input())
for i in range(t):
	(n, l) = lmii()
	nums = lmii()
	nums.sort(reverse=True)
	teams = 0
	clen = 0
	for i in range(len(nums)):
		if (clen + 1) * nums[i] >= l:
			teams += 1
			clen = 0
		else:
			clen += 1
	print(teams)


from sys import stdin, stdout
input = stdin.readline
tc = int(input())
for t in range(tc):
	minimum = int(input().split()[1])
	programmers = list(map(int, input().split()))
	maximumTeams = 0
	position = 1
	programmers.sort()
	programmers.reverse()
	for i in range(len(programmers)):
		if programmers[i] >= minimum:
			maximumTeams = maximumTeams + 1
		elif programmers[i] * position >= minimum:
			maximumTeams = maximumTeams + 1
			position = 1
		else:
			position = position + 1
	print(maximumTeams)


from collections import deque
n = int(input())
for _ in range(n):
	(n, x) = [int(p) for p in input().split()]
	arr = deque(sorted([int(p) for p in input().split()], reverse=True))
	temp = []
	ct = 0
	while arr:
		temp.append(arr.popleft())
		if temp[-1] * len(temp) >= x:
			ct += 1
			temp = []
	print(ct)


from sys import stdin
for _ in range(int(stdin.readline())):
	(n, x) = map(int, stdin.readline().split())
	arr = sorted(list(map(int, stdin.readline().split())), reverse=True)
	i = val = cou = ans = 0
	while i != n:
		cou += 1
		val = arr[i] * cou
		if val >= x:
			ans += 1
			cou = 0
		i += 1
	print(ans)


import sys
import math
import bisect
from sys import stdin
from itertools import groupby
from heapq import heapify, heappop, heappush
from collections import deque, Counter, OrderedDict
input = iter(sys.stdin.buffer.read().decode().splitlines()).__next__

def neo():
	return map(int, input().split())

def Neo():
	return list(map(int, input().split()))
for _ in range(int(input())):
	(N, X) = neo()
	A = Neo()
	A.sort(reverse=True)
	(Ans, p, i) = (0, 1, 0)
	while i < N:
		t = math.ceil(X / A[i])
		if p >= t:
			Ans += 1
			p = 1
			i += 1
		elif i + t < N and math.ceil(X / A[i + t - 1]) == t:
			Ans += 1
			i += t
		else:
			i += 1
			p += 1
	print(Ans)


from collections import Counter
t = int(input())
cnt = 0
while cnt < t:
	cnt += 1
	(n, x) = [int(i) for i in input().split()]
	a = [int(i) for i in input().split()]
	tmp = [(x - 1) // elem + 1 for elem in a]
	tmp = Counter(tmp)
	tmp = sorted(([key, value] for (key, value) in tmp.items()))
	total = 0
	ln = len(tmp)
	for (i, elem) in enumerate(tmp):
		total += elem[1] // elem[0]
		if i < ln - 1:
			tmp[i + 1][1] += elem[1] % elem[0]
	print(total)


import sys
input = sys.stdin.readline
T = int(input())
for _ in range(T):
	(n, x) = [int(inp) for inp in input().strip().split(' ')]
	numbers = [int(inp) for inp in input().strip().split(' ')]
	numbers = sorted(numbers)[::-1]
	current_count = 0
	team_count = 0
	for num in numbers:
		current_count += 1
		if current_count * num >= x:
			team_count += 1
			current_count = 0
	print(team_count)


def function(n, x, nums):
	if n == 0:
		return 0
	nums1 = sorted(nums, reverse=True)
	count = 0
	l = []
	c = 1
	for j in nums1:
		if j * c >= x:
			count += 1
			c = 0
		c += 1
	return count
t = int(input())
for k1 in range(t):
	l = list(map(int, input().rstrip().split()))
	n = l[0]
	x = l[1]
	nums = list(map(int, input().rstrip().split()))
	print(function(n, x, nums))


t = int(input())
for test in range(t):
	(n, x) = map(int, input().split())
	a = list(map(int, input().split()))
	a.sort(reverse=True)
	teams = 0
	members = 0
	for i in range(n):
		members += 1
		if a[i] * members >= x:
			teams += 1
			members = 0
	print(teams)


import sys
from collections import Counter

def get_ints():
	return list(map(int, sys.stdin.readline().strip().split()))
sys.setrecursionlimit(20000)
T = int(input())
for _ in range(T):
	(n, x) = get_ints()
	A = get_ints()
	A.sort(reverse=True)
	teams = 0
	to_be_teamed = 0
	for i in range(len(A)):
		if A[i] >= x:
			teams += 1
		else:
			to_be_teamed += 1
			if A[i] * to_be_teamed >= x:
				teams += 1
				to_be_teamed = 0
	print(teams)


t = int(input())
for tt in range(t):
	(n, x) = map(int, input().split())
	a = list(map(int, input().split()))
	a.sort(reverse=True)
	cnt = 0
	curr = -1
	foo = 0
	for i in a:
		if curr == -1:
			curr = i
		else:
			curr = min(curr, i)
		foo += 1
		if curr * foo >= x:
			cnt += 1
			foo = 0
			curr = -1
	print(cnt)


t = int(input())
for _ in range(t):
	(n, x) = map(int, input().split())
	arr = list(map(int, input().split()))
	arr.sort()
	ans = [0] * (n + 1)
	for i in range(n - 1, -1, -1):
		req = 0
		if x % arr[i] == 0:
			req = int(x / arr[i])
		else:
			req = int(x / arr[i]) + 1
		if i + req > n:
			continue
		ans[i] = 1 + ans[i + req]
	print(max(ans))


for t in range(int(input())):
	(n, x) = map(int, input().split())
	a = [int(s) for s in input().split()]
	a.sort(reverse=True)
	count = 0
	teklen = 0
	for i in a:
		teklen += 1
		if teklen * i >= x:
			count += 1
			teklen = 0
	print(count)


for i in range(int(input())):
	(n, x) = [int(x) for x in input().split()]
	data = sorted([int(x) for x in input().split()])[::-1]
	ans = 0
	kolvo = 1
	for j in range(n):
		if data[j] * kolvo >= x:
			kolvo = 0
			ans += 1
		kolvo += 1
	print(ans)


def helper(arr, n, x):
	arr.sort(reverse=True)
	(count, teams) = (1, 0)
	for i in range(n):
		if arr[i] * count >= x:
			teams += 1
			count = 1
			continue
		count += 1
	return teams
test = int(input())
for i in range(test):
	(n, x) = list(map(int, input().split()))
	arr = list(map(int, input().split()))
	ans = helper(arr, n, x)
	print(ans)


t = int(input())
for i in range(t):
	(n, x) = map(int, input().split())
	a = list(map(int, input().split()))
	a.sort()
	m = 1
	(count, j) = (0, 0)
	a = a[::-1]
	while j <= len(a) - 1:
		if a[j] * m >= x:
			count += 1
			m = 1
			j += m
		else:
			m += 1
			j += 1
	print(count)


for _ in range(int(input())):
	(a, b) = map(int, input().split())
	v = list(map(int, input().split()))
	v.sort(reverse=True)
	s = c = 0
	for i in range(a):
		c += 1
		if c * v[i] >= b:
			s += 1
			c = 0
	print(s)


from math import ceil
t = int(input())
while t:
	t -= 1
	(n, x) = map(int, input().split())
	a = list(map(int, input().split()))
	a.sort(reverse=True)
	ans = 0
	i = 0
	c = 0
	while i < n:
		if a[i] >= x:
			ans += 1
		else:
			c += 1
			if a[i] * c >= x:
				ans += 1
				c = 0
		i += 1
	print(ans)


__MULTITEST = True

def solve():
	(n, x) = map(int, input().split())
	a = list(map(int, input().split()))
	a.sort()
	group = 0
	ptr = n - 1
	members = 0
	currentMin = int(10000000000.0)
	while ptr > -1:
		currentMin = min(currentMin, a[ptr])
		members += 1
		if currentMin * members >= x:
			group += 1
			members = 0
			currentMin = int(10000000000.0)
		ptr -= 1
	print(group)
t = int(input()) if __MULTITEST else 1
for tt in range(t):
	solve()


def solve_3(A, x):
	A.sort()
	n = len(A)
	B = []
	count = 0
	for i in A:
		if i < x:
			B.append(i)
		else:
			count += 1
	B.reverse()
	skore = 0
	size = 0
	for i in range(len(B)):
		size += 1
		skore = size * B[i]
		if skore >= x:
			count += 1
			skore = 0
			size = 0
	return count
T = int(input())
for i in range(T):
	(n, x) = input().split()
	N = int(n)
	X = int(x)
	A = [int(i) for i in input().split()][:N]
	print(solve_3(A, X))


I = lambda : map(int, input().split())
(t,) = I()
for _ in [0] * t:
	(n, x) = I()
	c = a = 1
	for i in sorted(I())[::-1]:
		if c * i >= x:
			a += 1
			c = 1
		else:
			c += 1
	print(a - 1)


import sys
import heapq, functools, collections
import math, random
from collections import Counter, defaultdict

def solve(lst, x):
	console('----- solving ------')
	lst = sorted(lst)[::-1]
	cnt = 0
	pdt = lst[0]
	res = 0
	for i in lst:
		cnt += 1
		pdt = min(i, pdt)
		if cnt * pdt >= x:
			res += 1
			cnt = 0
			pdt = i
	return res

def console(*args):
	print('\x1b[36m', *args, '\x1b[0m', file=sys.stderr)
	return
for case_num in range(int(input())):
	(_, x) = list(map(int, input().split()))
	lst = list(map(int, input().split()))
	res = solve(lst, x)
	print(res)


import math
import time
from collections import defaultdict, deque
from sys import stdin, stdout
from bisect import bisect_left, bisect_right
t = int(input())
for _ in range(t):
	(n, x) = map(int, stdin.readline().split())
	a = list(map(int, stdin.readline().split()))
	ans = 0
	a.sort(reverse=True)
	temp = 0
	for i in a:
		temp += 1
		if temp * i >= x:
			temp = 0
			ans += 1
	print(ans)


from math import ceil
y = int(input())
for i in range(y):
	(n, x) = map(int, input().split())
	a = list(map(int, input().split()))
	a.sort(reverse=True)
	j = 0
	ans = 0
	b = 0
	while j < n:
		if x / a[j] > 1:
			q = ceil(x / a[j])
			b += 1
			if b == q:
				ans += 1
				b = 0
			j += 1
		else:
			j += 1
			ans += 1
			b = 0
	print(ans)


t = int(input())
for _ in range(t):
	(n, x) = map(int, input().split())
	a = sorted(list(map(int, input().split())), reverse=True)
	(res, cur) = (0, 1)
	for s in a:
		if s * cur >= x:
			res += 1
			cur = 0
		cur += 1
	print(res)


from math import ceil
for i in range(int(input())):
	(n, x) = map(int, input().split())
	a = [int(X) for X in input().split()]
	a.sort()
	dp = [0 for j in range(n + 1)]
	for j in range(n - 1, -1, -1):
		if x % a[j] == 0:
			if j + x // a[j] > n:
				dp[j] = 0
			else:
				dp[j] = dp[j + x // a[j]] + 1
		elif j + x // a[j] + 1 > n:
			dp[j] = 0
		else:
			dp[j] = dp[j + x // a[j] + 1] + 1
	print(max(dp))


a = int(input(''))
for i in range(0, a):
	(n, x) = map(int, input().split())
	skill = list(map(int, input().split()))
	skill.sort(reverse=True)
	i = 0
	count = 0
	ans = 0
	while i < n:
		count = count + 1
		p = count * skill[i]
		if p >= x:
			ans = ans + 1
			count = 0
		i = i + 1
	print(ans)


t = int(input())
for i in range(t):
	ch = input()
	L = [int(i) for i in ch.split()]
	(n, x) = (L[0], L[1])
	ch = input()
	L = [int(i) for i in ch.split()]
	nb = 0
	L.sort(reverse=True)
	a = -1
	for i in range(n):
		if (i - a) * L[i] >= x:
			nb += 1
			a = i
	print(nb)


from collections import defaultdict
from math import ceil
for _ in range(int(input())):
	(n, x) = map(int, input().split())
	l = list(map(int, input().split()))
	d = defaultdict(list)
	for i in range(n):
		key = ceil(x / l[i])
		d[key].append(l[i])
	ans = 0
	rem = 0
	for (k, v) in sorted(d.items()):
		ans += (rem + len(v)) // k
		rem = (rem + len(v)) % k
	print(ans)


import sys
I = lambda : map(int, sys.stdin.readline().split())
pr = lambda x: sys.stdout.write(f'{x}\n')

def solve():
	(n, x, c, l) = (*I(), 0, 0)
	a = sorted([*I()], reverse=True)
	for (i, y) in enumerate(a):
		if y * (i - l + 1) >= x:
			l = i + 1
			c += 1
	pr(c)

def main():
	for _ in range(*I()):
		solve()
main()


for _ in range(int(input())):
	(n, k) = map(int, input().split())
	arr = sorted(list(map(int, input().split())), reverse=True)
	(ans, cur) = (0, 1)
	for s in arr:
		if s * cur >= k:
			ans += 1
			cur = 0
		cur += 1
	print(ans)


t = int(input())
while t:
	line = input().split()
	(n, x) = (int(line[0]), int(line[1]))
	a = input().split()
	a = list(map(int, a))
	cnt = 0
	a.sort()
	j = 1
	for i in range(n - 1, -1, -1):
		if j * a[i] >= x:
			cnt += 1
			j = 1
		else:
			j += 1
	print(cnt)
	t -= 1


import random
import math
from collections import defaultdict
import itertools
from sys import stdin, stdout
import sys
import operator
from decimal import Decimal

def call(a, pos, x):
	p = 1
	while a[pos] * p < x:
		if pos > 0:
			pos -= 1
			p += 1
		else:
			return 0
	if pos > 0:
		cnt = call(a[:pos], pos - 1, x)
	else:
		cnt = 0
	return 1 + cnt

def main():
	mod = 10 ** 9 + 7
	t = int(input())
	for _ in range(t):
		(n, x) = list(map(int, input().split()))
		a = list(map(int, input().split()))
		a.sort(reverse=True)
		cnt = 0
		for i in range(n):
			if a[i] >= x:
				cnt += 1
			else:
				break
		while i < n - 1:
			for j in range(i, n):
				prev = a[j] * (j - i + 1)
				if prev >= x:
					cnt += 1
					i = j + 1
					break
			if j == n - 1:
				break
		print(cnt)
main()


import sys
input = sys.stdin.readline
(inp, ip) = (lambda : int(input()), lambda : [int(w) for w in input().split()])
for _ in range(inp()):
	(n, k) = ip()
	x = ip()
	x.sort(reverse=True)
	ct = 0
	prev = -1
	for i in range(n):
		if x[i] >= k:
			ct += 1
			continue
		if prev == -1:
			prev = i
			continue
		if (i - prev + 1) * x[i] >= k:
			ct += 1
			prev = -1
	print(ct)


for _ in range(int(input())):
	(n, x) = map(int, input().split())
	arr = list(map(int, input().split()))
	arr.sort()
	ans = 0
	n -= 1
	while n >= 0:
		tmp = 1
		while arr[n] * tmp < x and n >= 0:
			n -= 1
			tmp += 1
		if arr[n] * tmp >= x and n >= 0:
			ans += 1
			n -= 1
	print(ans)


for _ in range(int(input())):
	(n, x) = map(int, input().split())
	a = [*map(int, input().split())]
	a.sort(reverse=True)
	i = 0
	ans = 0
	mult = 1
	pers = 0
	while i < n:
		if a[i] * (pers + 1) < x:
			pers += 1
			i += 1
		elif a[i] * (pers + 1) >= x:
			ans += 1
			pers = 0
			i += 1
	print(ans)


for t in range(int(input())):
	(n, x) = map(int, input().split())
	a = list(map(int, input().split()))
	a.sort(reverse=True)
	count = current = 0
	for num in a:
		if num >= x:
			count += 1
		else:
			current += 1
			if current * num >= x:
				count += 1
				current = 0
	print(count)


for _ in range(int(input())):
	(n, x) = map(int, input().split())
	l = sorted(list(map(int, input().split())))[::-1]
	(ans, curr_count) = (0, 0)
	for i in range(n):
		curr_count += 1
		if curr_count * l[i] >= x:
			ans += 1
			curr_count = 0
	print(ans)


def main():
	for _ in range(int(input())):
		(n, x) = list(map(int, input().split()))
		arr = list(map(int, input().split()))
		arr = sorted(arr, reverse=True)
		k = 1
		i = 0
		count = 0
		while i + k - 1 < n:
			if arr[i + k - 1] >= x / k:
				i += k
				count += 1
			else:
				k += 1
		print(count)
main()


for test_i in range(int(input())):
	(n, x) = map(int, input().split())
	skills = list(map(int, input().split()))
	if x == 1:
		print(n)
	else:
		skills.sort()
		i0 = 0
		while skills[i0] == 1:
			i0 += 1
			if i0 == n:
				break
		ans = 0
		di = 0
		for i in range(1, n - i0 + 1):
			if (x - 1) // skills[-i] + 1 - (i - di) <= 0:
				ans += 1
				di = i
		ans += (n - di) // x
		print(ans)


t = int(input())
for i in range(t):
	(n, x) = map(int, input().split())
	ai = list(map(int, input().split()))
	ai.sort()
	ai.reverse()
	num = 1
	ans = 0
	i = 0
	while i < n:
		if num * ai[i] >= x:
			ans += 1
			num = 0
		num += 1
		i += 1
	print(ans)


import os
import sys
from io import BytesIO, IOBase

def main():
	for _ in range(int(input())):
		(n, x) = map(int, input().split())
		a = sorted(list(map(int, input().split())), reverse=True)
		ans = 0
		cnt = 1
		for i in range(n):
			if a[i] * cnt >= x:
				ans += 1
				cnt = 0
			cnt += 1
		print(ans)
BUFSIZE = 8192

class FastIO(IOBase):
	newlines = 0

	def __init__(self, file):
		self._fd = file.fileno()
		self.buffer = BytesIO()
		self.writable = 'x' in file.mode or 'r' not in file.mode
		self.write = self.buffer.write if self.writable else None

	def read(self):
		while True:
			b = os.read(self._fd, max(os.fstat(self._fd).st_size, BUFSIZE))
			if not b:
				break
			ptr = self.buffer.tell()
			(self.buffer.seek(0, 2), self.buffer.write(b), self.buffer.seek(ptr))
		self.newlines = 0
		return self.buffer.read()

	def readline(self):
		while self.newlines == 0:
			b = os.read(self._fd, max(os.fstat(self._fd).st_size, BUFSIZE))
			self.newlines = b.count(b'\n') + (not b)
			ptr = self.buffer.tell()
			(self.buffer.seek(0, 2), self.buffer.write(b), self.buffer.seek(ptr))
		self.newlines -= 1
		return self.buffer.readline()

	def flush(self):
		if self.writable:
			os.write(self._fd, self.buffer.getvalue())
			(self.buffer.truncate(0), self.buffer.seek(0))

class IOWrapper(IOBase):

	def __init__(self, file):
		self.buffer = FastIO(file)
		self.flush = self.buffer.flush
		self.writable = self.buffer.writable
		self.write = lambda s: self.buffer.write(s.encode('ascii'))
		self.read = lambda : self.buffer.read().decode('ascii')
		self.readline = lambda : self.buffer.readline().decode('ascii')
(sys.stdin, sys.stdout) = (IOWrapper(sys.stdin), IOWrapper(sys.stdout))
input = lambda : sys.stdin.readline().rstrip('\r\n')
main()


t = int(input())
for _ in range(t):
	(n, x) = map(int, input().split())
	l = list(map(int, input().split()))
	l.sort()
	c = 0
	i = n - 1
	while l and l[-1] >= x:
		l.pop()
		c += 1
		i -= 1
	while i >= 0:
		cur = l[i]
		count = 1
		while i > -1 and cur * count < x:
			count += 1
			i -= 1
			if i == -1:
				break
			cur = l[i]
		if i < 0:
			break
		i -= 1
		c += 1
	print(c)


import sys

def rs():
	return sys.stdin.readline().rstrip()

def ri():
	return int(sys.stdin.readline())

def ria():
	return list(map(int, sys.stdin.readline().split()))

def ws(s):
	sys.stdout.write(s)
	sys.stdout.write('\n')

def wi(n):
	sys.stdout.write(str(n))
	sys.stdout.write('\n')

def wia(a, sep=' '):
	sys.stdout.write(sep.join([str(x) for x in a]))
	sys.stdout.write('\n')

def can(t, n, x, a):
	cnt = 0
	mx = 10 ** 9 + 1
	c = 0
	mn = mx
	for i in range(n):
		c += 1
		mn = min(mn, a[i])
		if c * mn >= x:
			cnt += 1
			c = 0
			mn = mx
			if cnt >= t:
				return True
	return False

def solve(n, x, a):
	a = sorted(a, reverse=True)
	lo = 0
	hi = n + 1
	while hi > lo + 1:
		mid = (lo + hi) // 2
		if can(mid, n, x, a):
			lo = mid
		else:
			hi = mid
	return lo

def main():
	for _ in range(ri()):
		(n, x) = ria()
		a = ria()
		wi(solve(n, x, a))
main()


for _ in range(int(input())):
	(n, k) = map(int, input().split())
	num = list(map(int, input().split()))
	num = sorted(num, reverse=True)
	(ans, cnt) = (0, 1)
	for s in num:
		if s * cnt >= k:
			ans += 1
			cnt = 0
		cnt += 1
	print(ans)


T = int(input())
for i in range(T):
	(n, x) = map(int, input().split())
	skills = list(map(int, input().split()))
	skills.sort()
	teams = 0
	count = 1
	for k in range(n - 1, -1, -1):
		if skills[k] * count >= x:
			teams += 1
			count = 1
		else:
			count += 1
	print(teams)


t = int(input())
for i in range(t):
	a = input().split()
	(n, x) = (int(a[0]), int(a[1]))
	lst = [int(x) for x in input().split()]
	lst.sort()
	teams = 0
	index = n
	j = 0
	while index > 0:
		j += 1
		if lst[index - 1] * j >= x:
			teams += 1
			j = 0
		index -= 1
	print(teams)


for it in range(int(input())):
	(n, x) = [int(i) for i in input().split()]
	a = [int(i) for i in input().split()]
	a.sort(reverse=True)
	i = 0
	ans = 0
	last = 0
	while i < n:
		last = i
		while i < n and (i - last + 1) * a[i] < x:
			i += 1
		if i == n:
			break
		ans += 1
		i += 1
	print(ans)


class Main:

	def main(self):
		t = int(input())
		for t1 in range(0, t):
			n1 = list(map(int, input().split()))
			x = n1[1]
			a = reversed(sorted(list(map(int, input().split()))))
			result = 0
			count = 0
			for a1 in a:
				count += 1
				if a1 * count >= x:
					result += 1
					count = 0
			print(result)
Main().main()


for _ in range(int(input())):
	(n, x) = map(int, input().split())
	arr = list(map(int, input().split()))
	arr.sort()
	temp = 1
	i = len(arr) - 1
	count = 0
	ptr = i
	while i >= 0:
		if arr[i] * temp >= x:
			count += 1
			i = ptr - temp
			ptr = i
			temp = 1
		else:
			temp += 1
			i -= 1
	print(count)


from collections import defaultdict
import sys, math
f = None
try:
	f = open('q1.input', 'r')
except IOError:
	f = sys.stdin
if 'xrange' in dir(__builtins__):
	range = xrange
sys.setrecursionlimit(10 ** 2)

def print_case_iterable(case_num, iterable):
	print('Case #{}: {}'.format(case_num, ' '.join(map(str, iterable))))

def print_case_number(case_num, iterable):
	print('Case #{}: {}'.format(case_num, iterable))

def print_iterable(A):
	print(' '.join(A))

def read_int():
	return int(f.readline().strip())

def read_int_array():
	return [int(x) for x in f.readline().strip().split(' ')]

def rns():
	a = [x for x in f.readline().split(' ')]
	return (int(a[0]), a[1].strip())

def read_string():
	return list(f.readline().strip())

def ri():
	return int(f.readline().strip())

def ria():
	return [int(x) for x in f.readline().strip().split(' ')]

def rns():
	a = [x for x in f.readline().split(' ')]
	return (int(a[0]), a[1].strip())

def rs():
	return list(f.readline().strip())

def bi(x):
	return bin(x)[2:]
from collections import deque
import math
NUMBER = 10 ** 9 + 7

def factorial(n):
	M = NUMBER
	f = 1
	for i in range(1, n + 1):
		f = f * i % M
	return f

def mult(a, b):
	return a * b % NUMBER

def minus(a, b):
	return (a - b) % NUMBER

def plus(a, b):
	return (a + b) % NUMBER

def egcd(a, b):
	if a == 0:
		return (b, 0, 1)
	else:
		(g, y, x) = egcd(b % a, a)
		return (g, x - b // a * y, y)

def modinv(a):
	m = NUMBER
	(g, x, y) = egcd(a, m)
	if g != 1:
		raise Exception('modular inverse does not exist')
	else:
		return x % m

def choose(n, k):
	if n < k:
		assert false
	return mult(factorial(n), modinv(mult(factorial(k), factorial(n - k)))) % NUMBER
from collections import deque, defaultdict
import heapq
from types import GeneratorType

def bootstrap(f, stack=[]):

	def wrappedfunc(*args, **kwargs):
		if stack:
			return f(*args, **kwargs)
		else:
			to = f(*args, **kwargs)
			while True:
				if type(to) is GeneratorType:
					stack.append(to)
					to = next(to)
				else:
					stack.pop()
					if not stack:
						break
					to = stack[-1].send(to)
			return to
	return wrappedfunc

def dfs(g, timeIn, timeOut, depths, parents):
	cnt = 0
	stack = [[1, 0, 0, 0]]
	while stack:
		(v, neig_i, parent, depth) = stack[-1]
		parents[v] = parent
		depths[v] = depth
		if neig_i == 0:
			timeIn[v] = cnt
			cnt += 1
		while neig_i < len(g[v]):
			u = g[v][neig_i]
			if u == parent:
				neig_i += 1
				continue
			stack[-1][1] = neig_i + 1
			stack.append([u, 0, v, depth + 1])
			break
		if neig_i == len(g[v]):
			stack.pop()
			timeOut[v] = cnt
			cnt += 1
cnt = 0

@bootstrap
def dfs(v, adj, timeIn, timeOut, depths, parents, parent=0, depth=0):
	global cnt
	parents[v] = parent
	depths[v] = depth
	timeIn[v] = cnt
	cnt += 1
	for u in adj[v]:
		if u == parent:
			continue
		yield dfs(u, adj, timeIn, timeOut, depths, parents, v, depth + 1)
	timeOut[v] = cnt
	cnt += 1
	yield

def gcd(a, b):
	if a == 0:
		return b
	return gcd(b % a, a)

def lcm(a, b):
	return a * b / gcd(a, b)

def get_num_2_5(n):
	twos = 0
	fives = 0
	while n > 0 and n % 2 == 0:
		n //= 2
		twos += 1
	while n > 0 and n % 5 == 0:
		n //= 5
		fives += 1
	return (twos, fives)

def shift(a, i, num):
	for _ in range(num):
		(a[i], a[i + 1], a[i + 2]) = (a[i + 2], a[i], a[i + 1])

def equal(x, y):
	return abs(x - y) <= 1e-09

def getAngle(a, b, c):
	ang = math.degrees(math.atan2(c[1] - b[1], c[0] - b[0]) - math.atan2(a[1] - b[1], a[0] - b[0]))
	return ang + 360 if ang < 0 else ang

def getLength(a, b):
	return math.sqrt((a[0] - b[0]) ** 2 + (a[1] - b[1]) ** 2)
from heapq import heapify, heappush, heappop

def solution(a, n, x):
	for i in range(n):
		a[i] = (x + a[i] - 1) // a[i]
	d = defaultdict(int)
	for y in a:
		d[y] += 1
	nums = sorted(set(a))
	res = 0
	for i in range(len(nums)):
		res += d[nums[i]] // nums[i]
		if i < len(nums) - 1:
			d[nums[i + 1]] += d[nums[i]] % nums[i]
	return res

def main():
	T = 1
	T = ri()
	for i in range(T):
		(n, x) = ria()
		a = ria()
		x = solution(a, n, x)
		if 'xrange' not in dir(__builtins__):
			print(x)
		else:
			(print >> output, str(x))
	if 'xrange' in dir(__builtins__):
		print(output.getvalue())
		output.close()
if 'xrange' in dir(__builtins__):
	import cStringIO
	output = cStringIO.StringIO()
main()


def solve(arr, n, x, ans):
	arr.sort()
	teams = 0
	size = 0
	while arr:
		min_val = arr.pop()
		size += 1
		if min_val * size >= x:
			teams += 1
			size = 0
	ans.append(teams)

def main():
	t = int(input())
	ans = []
	for i in range(t):
		(n, x) = map(int, input().split())
		arr = list(map(int, input().split()))
		solve(arr, n, x, ans)
	for i in ans:
		print(i)
main()


import sys
sys.setrecursionlimit(10 ** 5)
int1 = lambda x: int(x) - 1
p2D = lambda x: print(*x, sep='\n')

def II():
	return int(sys.stdin.readline())

def MI():
	return map(int, sys.stdin.readline().split())

def LI():
	return list(map(int, sys.stdin.readline().split()))

def LLI(rows_number):
	return [LI() for _ in range(rows_number)]

def SI():
	return sys.stdin.readline()[:-1]
for _ in range(II()):
	(n, x) = MI()
	aa = LI()
	ans = 0
	cnt = 0
	aa.sort(reverse=True)
	for a in aa:
		cnt += 1
		if a * cnt >= x:
			ans += 1
			cnt = 0
	print(ans)


import math
for _ in range(int(input())):
	(n, x) = map(int, input().split())
	a = list(sorted(map(int, input().split()), reverse=True))
	team = count = 0
	for i in range(n):
		count += 1
		if count * a[i] >= x:
			team += 1
			count = 0
	print(team)


import os
import sys
import math
from io import BytesIO, IOBase
from fractions import Fraction
from collections import defaultdict
from itertools import permutations
BUFSIZE = 8192

class FastIO(IOBase):
	newlines = 0

	def __init__(self, file):
		self._fd = file.fileno()
		self.buffer = BytesIO()
		self.writable = 'x' in file.mode or 'r' not in file.mode
		self.write = self.buffer.write if self.writable else None

	def read(self):
		while True:
			b = os.read(self._fd, max(os.fstat(self._fd).st_size, BUFSIZE))
			if not b:
				break
			ptr = self.buffer.tell()
			(self.buffer.seek(0, 2), self.buffer.write(b), self.buffer.seek(ptr))
		self.newlines = 0
		return self.buffer.read()

	def readline(self):
		while self.newlines == 0:
			b = os.read(self._fd, max(os.fstat(self._fd).st_size, BUFSIZE))
			self.newlines = b.count(b'\n') + (not b)
			ptr = self.buffer.tell()
			(self.buffer.seek(0, 2), self.buffer.write(b), self.buffer.seek(ptr))
		self.newlines -= 1
		return self.buffer.readline()

	def flush(self):
		if self.writable:
			os.write(self._fd, self.buffer.getvalue())
			(self.buffer.truncate(0), self.buffer.seek(0))

class IOWrapper(IOBase):

	def __init__(self, file):
		self.buffer = FastIO(file)
		self.flush = self.buffer.flush
		self.writable = self.buffer.writable
		self.write = lambda s: self.buffer.write(s.encode('ascii'))
		self.read = lambda : self.buffer.read().decode('ascii')
		self.readline = lambda : self.buffer.readline().decode('ascii')
(sys.stdin, sys.stdout) = (IOWrapper(sys.stdin), IOWrapper(sys.stdout))
input = lambda : sys.stdin.readline().rstrip('\r\n')
for t in range(int(input())):
	(n, m) = map(int, input().split())
	l = list(map(int, input().split()))
	l.sort()
	ans = 0
	f = -1
	for i in range(n - 1, -1, -1):
		if l[i] >= m:
			ans += 1
		else:
			f = i
			break
	c = 1
	for i in range(f, -1, -1):
		if l[i] * c >= m:
			ans += 1
			c = 1
		else:
			c += 1
	print(ans)


import io
import os
input = io.BytesIO(os.read(0, os.fstat(0).st_size)).readline

def get_str():
	return input().decode().strip()

def rint():
	return map(int, input().split())

def oint():
	return int(input())
t = oint()
for _ in range(t):
	(n, x) = rint()
	a = list(rint())
	a.sort(reverse=True)
	tcnt = 0
	mcnt = 0
	for i in range(n):
		mcnt += 1
		if mcnt * a[i] >= x:
			tcnt += 1
			mcnt = 0
	print(tcnt)


tests = int(input())
for _ in range(tests):
	(n, x) = map(int, input().split())
	a = sorted(map(int, input().split()), reverse=True)
	cnt = 0
	ans = 0
	for e in a:
		cnt += 1
		if e * cnt >= x:
			ans += 1
			cnt = 0
	print(ans)


import math
from collections import deque
import sys
sys.setrecursionlimit(10 ** 4)

def Divisors(n):
	l = []
	i = 2
	while i <= math.sqrt(n):
		if n % i == 0:
			if n // i == i:
				l.append(i)
			else:
				l.append(i)
				l.append(n // i)
		i = i + 1
	return l

def SieveOfEratosthenes(n):
	l = []
	prime = [True for i in range(n + 1)]
	p = 2
	while p * p <= n:
		if prime[p] == True:
			for i in range(p * p, n + 1, p):
				prime[i] = False
		p += 1
	for p in range(2, n + 1):
		if prime[p]:
			l.append(p)
	return l

def primeFactors(n):
	l = []
	while n % 2 == 0:
		l.append(2)
		n = n / 2
	for i in range(3, int(math.sqrt(n)) + 1, 2):
		while n % i == 0:
			l.append(i)
			n = n / i
	if n > 2:
		l.append(n)
	return l

def Factors(n):
	result = []
	for i in range(2, int(math.sqrt(n)) + 1):
		if n % i == 0:
			if i == n / i:
				result.append(i)
			else:
				result.append(i)
				result.append(n // i)
	result.append(1)
	return result

def maxSubArraySum(a):
	max_so_far = 0
	max_ending_here = 0
	size = len(a)
	for i in range(0, size):
		max_ending_here = max_ending_here + a[i]
		if max_so_far < abs(max_ending_here):
			max_so_far = max_ending_here
	return max_so_far

def longestsubarray(arr, n, k):
	current_count = 0
	max_count = 0
	for i in range(0, n, 1):
		if arr[i] % k != 0:
			current_count += 1
		else:
			current_count = 0
		max_count = max(current_count, max_count)
	return max_count

def main():
	(n, x) = list(map(int, input().split()))
	l = list(map(int, input().split()))
	l.sort()
	c = 1
	ans = 0
	for j in range(len(l) - 1, -1, -1):
		if l[j] * c >= x:
			ans += 1
			c = 1
		else:
			c += 1
	print(ans)
t = int(input())
for i in range(0, t):
	main()


from sys import stdin
import math
for _ in range(int(stdin.readline())):
	(n, x) = list(map(int, stdin.readline().split()))
	a = sorted(map(int, stdin.readline().split()), reverse=True)
	dp = [0] * n
	res = 0
	for (idx, val) in enumerate(a):
		needed = math.ceil(x / val) - 1
		if needed == 0:
			dp[idx] = res + 1
			res += 1
		else:
			t = idx - needed - 1
			if t < -1:
				dp[idx] = res
			elif t == -1:
				dp[idx] = 1
				if res == 0:
					res = 1
			else:
				dp[idx] = dp[t] + 1
				if dp[idx] > res:
					res += 1
	print(res)


import math
for _ in range(int(input())):
	(n, x) = map(int, input().split())
	arr = list(map(int, input().split()))
	arr.sort(reverse=True)
	(teams, members) = (0, 1)
	for i in range(n):
		if arr[i] * members >= x:
			teams += 1
			members = 0
		members += 1
	print(teams)


for _ in range(int(input())):
	(n, x) = map(int, input().split())
	A = list(map(int, input().split()))
	A.sort(reverse=True)
	ans = 0
	c = 1
	for i in A:
		if i * c >= x:
			ans += 1
			c = 0
		c += 1
	print(ans)


for test in range(int(input())):
	(n, k) = map(int, input().split())
	a = list(map(int, input().split()))
	a.sort()
	i = 1
	mn = 1
	ans = 0
	while i <= n:
		if a[-i] * mn >= k:
			ans += 1
			mn = 1
		else:
			mn += 1
		i += 1
	print(ans)


from __future__ import division, print_function
import os, sys
from io import BytesIO, IOBase
if sys.version_info[0] < 3:
	from __builtin__ import xrange as range
	from future_builtins import ascii, filter, hex, map, oct, zip

def ii():
	return int(input())

def si():
	return input()

def mi():
	return map(int, input().strip().split(' '))

def msi():
	return map(str, input().strip().split(' '))

def li():
	return list(mi())

def dmain():
	sys.setrecursionlimit(1000000)
	threading.stack_size(1024000)
	thread = threading.Thread(target=main)
	thread.start()
import sys
input = sys.stdin.readline
scanner = lambda : int(input())
string = lambda : input().rstrip()
get_list = lambda : list(read())
read = lambda : map(int, input().split())
get_float = lambda : map(float, input().split())

def ceil(x):
	if x != int(x):
		x = int(x) + 1
	return x

def factorial(x, m):
	val = 1
	while x > 0:
		val = val * x % m
		x -= 1
	return val

def fact(x):
	val = 1
	while x > 0:
		val *= x
		x -= 1
	return val

def swaparr(arr, a, b):
	temp = arr[a]
	arr[a] = arr[b]
	arr[b] = temp

def gcd(a, b):
	if b == 0:
		return a
	return gcd(b, a % b)

def lcm(a, b):
	return a * b // math.gcd(a, b)

def is_integer(n):
	return math.ceil(n) == math.floor(n)

def nCr(n, k):
	if k > n:
		return 0
	if k > n - k:
		k = n - k
	res = 1
	for i in range(k):
		res = res * (n - i)
		res = res / (i + 1)
	return int(res)

def primefs(n):
	primes = {}
	while n % 2 == 0 and n > 0:
		primes[2] = primes.get(2, 0) + 1
		n = n // 2
	for i in range(3, int(n ** 0.5) + 2, 2):
		while n % i == 0 and n > 0:
			primes[i] = primes.get(i, 0) + 1
			n = n // i
	if n > 2:
		primes[n] = primes.get(n, 0) + 1
	return primes

def power(x, y, p):
	res = 1
	x = x % p
	if x == 0:
		return 0
	while y > 0:
		if y & 1 == 1:
			res = res * x % p
		y = y >> 1
		x = x * x % p
	return res

def swap(a, b):
	temp = a
	a = b
	b = temp
	return (a, b)

def find(x, link):
	p = x
	while p != link[p]:
		p = link[p]
	while x != p:
		nex = link[x]
		link[x] = p
		x = nex
	return p

def union(x, y, link, size):
	x = find(x, link)
	y = find(y, link)
	if size[x] < size[y]:
		(x, y) = swap(x, y)
	if x != y:
		size[x] += size[y]
		link[y] = x

def sieve(n):
	prime = [True for i in range(n + 1)]
	(prime[0], prime[1]) = (False, False)
	p = 2
	while p * p <= n:
		if prime[p] == True:
			for i in range(p * p, n + 1, p):
				prime[i] = False
		p += 1
	return prime

def phi(n):
	result = n
	p = 2
	while p * p <= n:
		if n % p == 0:
			while n % p == 0:
				n = n // p
			result = result * (1.0 - 1.0 / float(p))
		p = p + 1
	if n > 1:
		result = result * (1.0 - 1.0 / float(n))
	return int(result)

def is_prime(n):
	if n == 0:
		return False
	if n == 1:
		return True
	for i in range(2, int(n ** (1 / 2)) + 1):
		if not n % i:
			return False
	return True

def next_prime(n, primes):
	while primes[n] != True:
		n += 1
	return n
MAXN = int(100000.0 + 5)

def spf_sieve():
	spf[1] = 1
	for i in range(2, MAXN):
		spf[i] = i
	for i in range(4, MAXN, 2):
		spf[i] = 2
	for i in range(3, ceil(MAXN ** 0.5), 2):
		if spf[i] == i:
			for j in range(i * i, MAXN, i):
				if spf[j] == j:
					spf[j] = i
spf = [0 for i in range(MAXN)]

def factoriazation(x):
	res = []
	for i in range(2, int(x ** 0.5) + 1):
		while x % i == 0:
			res.append(i)
			x //= i
	if x != 1:
		res.append(x)
	return res

def factors(n):
	res = []
	for i in range(1, int(n ** 0.5) + 1):
		if n % i == 0:
			res.append(i)
			res.append(n // i)
	return list(set(res))

def int_array():
	return list(map(int, input().strip().split()))

def float_array():
	return list(map(float, input().strip().split()))

def str_array():
	return input().strip().split()

def binary_search(low, high, w, h, n):
	while low < high:
		mid = low + (high - low) // 2
		if check(mid, w, h, n):
			low = mid + 1
		else:
			high = mid
	return low

def check(beauty, s, n, count):
	pass
MOD = int(1000000000.0) + 7
CMOD = 998244353
INF = float('inf')
NINF = -float('inf')
alphs = 'abcdefghijklmnopqrstuvwxyz'
from itertools import permutations
import math
import bisect as bis
import random
import sys
import collections as collect

def solve():
	(n, x) = read()
	programmers = get_list()
	programmers.sort(reverse=True)
	ans = 0
	j = 0
	for i in range(n):
		j += 1
		if programmers[i] * j >= x:
			j = 0
			ans += 1
	print(ans)
BUFSIZE = 8192

class FastIO(IOBase):
	newlines = 0

	def __init__(self, file):
		self._fd = file.fileno()
		self.buffer = BytesIO()
		self.writable = 'x' in file.mode or 'r' not in file.mode
		self.write = self.buffer.write if self.writable else None

	def read(self):
		while True:
			b = os.read(self._fd, max(os.fstat(self._fd).st_size, BUFSIZE))
			if not b:
				break
			ptr = self.buffer.tell()
			(self.buffer.seek(0, 2), self.buffer.write(b), self.buffer.seek(ptr))
		self.newlines = 0
		return self.buffer.read()

	def readline(self):
		while self.newlines == 0:
			b = os.read(self._fd, max(os.fstat(self._fd).st_size, BUFSIZE))
			self.newlines = b.count(b'\n') + (not b)
			ptr = self.buffer.tell()
			(self.buffer.seek(0, 2), self.buffer.write(b), self.buffer.seek(ptr))
		self.newlines -= 1
		return self.buffer.readline()

	def flush(self):
		if self.writable:
			os.write(self._fd, self.buffer.getvalue())
			(self.buffer.truncate(0), self.buffer.seek(0))

class IOWrapper(IOBase):

	def __init__(self, file):
		self.buffer = FastIO(file)
		self.flush = self.buffer.flush
		self.writable = self.buffer.writable
		self.write = lambda s: self.buffer.write(s.encode('ascii'))
		self.read = lambda : self.buffer.read().decode('ascii')
		self.readline = lambda : self.buffer.readline().decode('ascii')

def print(*args, **kwargs):
	(sep, file) = (kwargs.pop('sep', ' '), kwargs.pop('file', sys.stdout))
	at_start = True
	for x in args:
		if not at_start:
			file.write(sep)
		file.write(str(x))
		at_start = False
	file.write(kwargs.pop('end', '\n'))
	if kwargs.pop('flush', False):
		file.flush()
if sys.version_info[0] < 3:
	(sys.stdin, sys.stdout) = (FastIO(sys.stdin), FastIO(sys.stdout))
else:
	(sys.stdin, sys.stdout) = (IOWrapper(sys.stdin), IOWrapper(sys.stdout))
input = lambda : sys.stdin.readline().rstrip('\r\n')
for i in range(scanner()):
	solve()


T = int(input())
for i in range(T):
	(n, x) = map(int, input().split(' '))
	a = list(map(int, input().split(' ')))
	a.sort()
	cnt = 0
	o = 0
	for u in a[::-1]:
		cnt += 1
		if cnt * u >= x:
			o += 1
			cnt = 0
	print(o)


t = int(input())
for _ in range(t):
	(n, x) = map(int, input().split())
	arr = [int(x) for x in input().split()]
	arr.sort(reverse=True)
	count = 0
	i = 0
	cont = 0
	while i < n:
		if arr[i] >= x:
			count += 1
		else:
			cont += 1
			if cont * arr[i] >= x:
				count += 1
				cont = 0
		i += 1
	print(count)


def CreateTheTeams(n, x, a):
	c = 0
	a.sort(reverse=True)
	l = 0
	for i in range(n):
		l = l + 1
		if a[i] * l >= x:
			c = c + 1
			l = 0
	return c
t = int(input())
for tt in range(t):
	nx = list(map(int, input().rstrip().split()))
	a = list(map(int, input().rstrip().split()))
	ans = CreateTheTeams(nx[0], nx[1], a)
	print(ans)


for _ in range(int(input())):
	(n, x) = map(int, input().split())
	a = list(map(int, input().split()))
	a.sort()
	ans = 0
	while len(a) != 0:
		if a[-1] >= x:
			a.pop()
			ans += 1
		else:
			break
	p = 0
	mi = 0
	while len(a) > 0:
		mi = a.pop()
		p += 1
		if mi * p >= x:
			ans += 1
			mi = 0
			p = 0
	print(ans)


(T,) = map(int, input().split())
import sys
input = sys.stdin.readline
from collections import defaultdict
for t in range(T):
	(N, x) = map(int, input().split())
	X = list(map(int, input().split()))
	X.sort()
	X = X[::-1]
	R = 0
	c = 0
	for i in range(N):
		c += 1
		if X[i] * c >= x:
			R += 1
			c = 0
	print(R)


from collections import Counter

def team(n, x, a):
	ans = 0
	skills_set = set(a)
	skills_counted = Counter(a)
	skills_sorted = sorted(skills_set, reverse=True)
	cur = 0
	for skill in skills_sorted:
		cur += skills_counted[skill]
		if skill * cur >= x:
			remainder = 0 if x % skill == 0 else 1
			programmers_needed = x // skill + remainder
			ans += cur // programmers_needed
			cur = cur % programmers_needed
	return ans
t = int(input())
for i in range(t):
	(n, x) = map(int, input().split())
	a = [int(i) for i in input().split()]
	print(team(n, x, a))


for _ in range(int(input())):
	(n, x) = map(int, input().split())
	arr = [int(x) for x in input().split()]
	arr.sort(reverse=True)
	count = 0
	c = 0
	mini = 0
	for i in range(n):
		c += 1
		if c * arr[i] >= x:
			count += 1
			c = 0
	print(count)


import sys, os
from io import BytesIO, IOBase
import collections, itertools, bisect, heapq, math, string
from decimal import *
BUFSIZE = 8192
BUFSIZE = 8192

class FastIO(IOBase):
	newlines = 0

	def __init__(self, file):
		self._fd = file.fileno()
		self.buffer = BytesIO()
		self.writable = 'x' in file.mode or 'r' not in file.mode
		self.write = self.buffer.write if self.writable else None

	def read(self):
		while True:
			b = os.read(self._fd, max(os.fstat(self._fd).st_size, BUFSIZE))
			if not b:
				break
			ptr = self.buffer.tell()
			(self.buffer.seek(0, 2), self.buffer.write(b), self.buffer.seek(ptr))
		self.newlines = 0
		return self.buffer.read()

	def readline(self):
		while self.newlines == 0:
			b = os.read(self._fd, max(os.fstat(self._fd).st_size, BUFSIZE))
			self.newlines = b.count(b'\n') + (not b)
			ptr = self.buffer.tell()
			(self.buffer.seek(0, 2), self.buffer.write(b), self.buffer.seek(ptr))
		self.newlines -= 1
		return self.buffer.readline()

	def flush(self):
		if self.writable:
			os.write(self._fd, self.buffer.getvalue())
			(self.buffer.truncate(0), self.buffer.seek(0))

class IOWrapper(IOBase):

	def __init__(self, file):
		self.buffer = FastIO(file)
		self.flush = self.buffer.flush
		self.writable = self.buffer.writable
		self.write = lambda s: self.buffer.write(s.encode('ascii'))
		self.read = lambda : self.buffer.read().decode('ascii')
		self.readline = lambda : self.buffer.readline().decode('ascii')
(sys.stdin, sys.stdout) = (IOWrapper(sys.stdin), IOWrapper(sys.stdout))
input = lambda : sys.stdin.readline().rstrip('\r\n')

def main():
	t = int(input())
	for i in range(t):
		(n, x) = map(int, input().split())
		a = list(map(int, input().split()))
		sa = sorted(a, reverse=True)
		(res, cur) = (0, 1)
		for s in sa:
			if s * cur >= x:
				res += 1
				cur = 0
			cur += 1
		print(res)
main()


from math import ceil
t = int(input())
for _ in range(t):
	(n, m) = map(int, input().split())
	l = list(map(int, input().split()))
	l.sort()
	dp = [0] * (n + 1)
	for i in range(n - 1, -1, -1):
		c = ceil(m / l[i])
		if c + i > n:
			dp[i] = dp[i + 1]
		else:
			dp[i] = max(dp[i + 1], 1 + dp[i + c])
	print(dp[0])


for _ in range(int(input())):
	(n, t) = map(int, input().split())
	a = list(map(int, input().split()))
	a.sort(reverse=True)
	F = [0] * (n + 3)
	ans = 0
	for x in range(0, n):
		x = int(x)
		m = int((t - 1) / a[x]) + 1
		if m <= x + 1:
			F[x + 1] = max(F[x + 1], F[x + 1 - m] + 1)
		ans = max(ans, F[x + 1])
	print(ans)


for _ in range(int(input())):
	(n, x) = map(int, input().split())
	l = list(map(int, input().split()))
	l.sort(reverse=True)
	(count, ans) = (1, 0)
	for i in l:
		if i * count >= x:
			ans += 1
			count = 0
		count += 1
	print(ans)


from bisect import bisect_left as bl
from bisect import bisect_right as br
from heapq import heappush, heappop, heapify
import math
from collections import *
from functools import reduce, cmp_to_key
import sys
input = sys.stdin.readline
M = mod = 998244353

def factors(n):
	return sorted(set(reduce(list.__add__, ([i, n // i] for i in range(1, int(n ** 0.5) + 1) if n % i == 0))))

def inv_mod(n):
	return pow(n, mod - 2, mod)

def li():
	return [int(i) for i in input().rstrip('\n').split()]

def st():
	return input().rstrip('\n')

def val():
	return int(input().rstrip('\n'))

def li2():
	return [i for i in input().rstrip('\n')]

def li3():
	return [int(i) for i in input().rstrip('\n')]
for _ in range(val()):
	(n, x) = li()
	l = sorted(li())[::-1]
	ans = curr = 0
	mi = float('inf')
	for i in range(n):
		curr += 1
		mi = min(mi, l[i])
		if curr * mi >= x:
			ans += 1
			mi = float('inf')
			curr = 0
	print(ans)


from __future__ import division, print_function
from sys import stdin, stdout
import bisect
import math
import heapq
i_m = 9223372036854775807

def inin():
	return int(input())

def stin():
	return input()

def spin():
	return map(int, stin().split())

def lin():
	return list(map(int, stin().split()))

def matrix(n):
	return [list(map(int, input().split())) for i in range(n)]

def calculate_sum(a, N):
	m = N / a
	sum = m * (m + 1) / 2
	ans = a * sum
	return ans

def series(N):
	return N * (N + 1) // 2

def count2Dmatrix(i, list):
	return sum((c.count(i) for c in list))

def modinv(n, p):
	return pow(n, p - 2, p)

def GCD(x, y):
	x = abs(x)
	y = abs(y)
	if min(x, y) == 0:
		return max(x, y)
	while y:
		(x, y) = (y, x % y)
	return x

def LCM(x, y):
	return x * y // GCD(x, y)

def Divisors(n):
	l = []
	for i in range(1, int(math.sqrt(n) + 1)):
		if n % i == 0:
			if n // i == i:
				l.append(i)
			else:
				l.append(i)
				l.append(n // i)
	return l

def isprime(n):
	for i in range(2, int(math.sqrt(n)) + 1):
		if n % i == 0:
			return False
	return True
prime = []

def SieveOfEratosthenes(n):
	global prime
	prime = [True for i in range(n + 1)]
	p = 2
	while p * p <= n:
		if prime[p] == True:
			for i in range(p * p, n + 1, p):
				prime[i] = False
		p += 1
	f = []
	for p in range(2, n):
		if prime[p]:
			f.append(p)
	return f
q = []

def dfs(n, d, v, c):
	global q
	v[n] = 1
	x = d[n]
	q.append(n)
	j = c
	for i in x:
		if i not in v:
			f = dfs(i, d, v, c + 1)
			j = max(j, f)
	return j
for _ in range(inin()):
	(n, x) = spin()
	a = lin()
	a = sorted(a)[::-1]
	team = 0
	cur = 1
	for i in a:
		if i * cur >= x:
			team += 1
			cur = 0
		cur += 1
	print(team)


from bisect import bisect_left as lower_bound, bisect_right as upper_bound
from sys import stdin, stdout
from collections import defaultdict

def solve(arr, n, mid, x):
	i = 0
	cnt = 0
	while i < n:
		j = i
		while j < n and arr[j] * (j - i + 1) < x:
			j += 1
		if j < n:
			cnt += 1
		i = j + 1
	return cnt >= mid

def main():
	t = int(input())
	for _ in range(t):
		(n, x) = list(map(int, input().strip().split()))
		arr = list(map(int, input().strip().split()))
		arr.sort(reverse=True)
		(lo, hi) = (0, n)
		ret = 0
		while lo <= hi:
			mid = (lo + hi) // 2
			if solve(arr, n, mid, x):
				ret = max(ret, mid)
				lo = mid + 1
			else:
				hi = mid - 1
		print(ret)
main()


for _ in range(int(input())):
	a = input().split(' ')
	(n, x) = (int(a[0]), int(a[1]))
	a = input().split(' ')
	for i in range(n):
		a[i] = int(a[i])
	a.sort(reverse=True)
	ans = 0
	i = 0
	while a != [] and i < len(a):
		if a[i] >= x:
			ans += 1
			i += 1
		else:
			j = i
			while j < len(a):
				if a[j] * (j - i + 1) >= x:
					ans += 1
					break
				j += 1
			i = j + 1
			if i >= len(a):
				break
	print(ans)


import sys
input = sys.stdin.readline
import heapq
import copy
import math
import decimal

def inp():
	return int(input())

def inlt():
	return list(map(int, input().split()))

def insr():
	s = input()
	return list(s[:len(s) - 1])

def insr2():
	s = input()
	return s[:len(s) - 1]

def invr():
	return map(int, input().split())

def pr_list(a):
	print(*a, sep=' ')

def main():
	tests = inp()
	mod = 1000000007
	limit = 10 ** 18
	ans = 0
	stack = []
	hashm = {}
	arr = []
	heapq.heapify(arr)
	for test in range(tests):
		[n, x] = inlt()
		a = inlt()
		a.sort()
		ans = 0
		i = n - 1
		while i >= 0:
			curr = 1
			while i >= 0:
				if curr * a[i] >= x:
					ans = ans + 1
					i = i - 1
					break
				else:
					curr = curr + 1
					i = i - 1
		print(ans)
main()


for test in range(int(input())):
	(n, x) = map(int, input().split())
	arr = list(map(int, input().split()))
	ans = 0
	arr.sort(reverse=True)
	coun = 0
	for i in range(n):
		if arr[i] >= x:
			ans += 1
		else:
			coun += 1
			if coun * arr[i] >= x:
				ans += 1
				coun = 0
	print(ans)


from __future__ import division, print_function
from fractions import Fraction
import sys
import os
from io import BytesIO, IOBase
from itertools import *
import bisect
from heapq import *
from math import *
from collections import deque
from collections import Counter as counter
from itertools import combinations as comb
from itertools import permutations as permutate
from bisect import bisect_left as bl
from bisect import bisect_right as br
from bisect import bisect
BUFSIZE = 8192

class FastIO(IOBase):
	newlines = 0

	def __init__(self, file):
		self._fd = file.fileno()
		self.buffer = BytesIO()
		self.writable = 'x' in file.mode or 'r' not in file.mode
		self.write = self.buffer.write if self.writable else None

	def read(self):
		while True:
			b = os.read(self._fd, max(os.fstat(self._fd).st_size, BUFSIZE))
			if not b:
				break
			ptr = self.buffer.tell()
			(self.buffer.seek(0, 2), self.buffer.write(b), self.buffer.seek(ptr))
		self.newlines = 0
		return self.buffer.read()

	def readline(self):
		while self.newlines == 0:
			b = os.read(self._fd, max(os.fstat(self._fd).st_size, BUFSIZE))
			self.newlines = b.count(b'\n') + (not b)
			ptr = self.buffer.tell()
			(self.buffer.seek(0, 2), self.buffer.write(b), self.buffer.seek(ptr))
		self.newlines -= 1
		return self.buffer.readline()

	def flush(self):
		if self.writable:
			os.write(self._fd, self.buffer.getvalue())
			(self.buffer.truncate(0), self.buffer.seek(0))

class IOWrapper(IOBase):

	def __init__(self, file):
		self.buffer = FastIO(file)
		self.flush = self.buffer.flush
		self.writable = self.buffer.writable
		self.write = lambda s: self.buffer.write(s.encode('ascii'))
		self.read = lambda : self.buffer.read().decode('ascii')
		self.readline = lambda : self.buffer.readline().decode('ascii')

def print(*args, **kwargs):
	(sep, file) = (kwargs.pop('sep', ' '), kwargs.pop('file', sys.stdout))
	at_start = True
	for x in args:
		if not at_start:
			file.write(sep)
		file.write(str(x))
		at_start = False
	file.write(kwargs.pop('end', '\n'))
	if kwargs.pop('flush', False):
		file.flush()
if sys.version_info[0] < 3:
	(sys.stdin, sys.stdout) = (FastIO(sys.stdin), FastIO(sys.stdout))
else:
	(sys.stdin, sys.stdout) = (IOWrapper(sys.stdin), IOWrapper(sys.stdout))
mod = 1000000007

def inp():
	return sys.stdin.readline().rstrip('\r\n')

def out(var):
	sys.stdout.write(str(var))

def lis():
	return list(map(int, inp().split()))

def stringlis():
	return list(map(str, inp().split()))

def sep():
	return map(int, inp().split())

def strsep():
	return map(str, inp().split())

def zerolist(n):
	return [0] * n

def nextline():
	out('\n')

def testcase(t):
	for p in range(t):
		solve()

def printlist(a):
	for p in range(0, len(a)):
		out(str(a[p]) + ' ')

def lcm(a, b):
	return a * b // gcd(a, b)

def power(a, b):
	ans = 1
	while b > 0:
		if b % 2 == 1:
			ans *= a
		a *= a
		b //= 2
	return ans

def ncr(n, r):
	return factorial(n) // (factorial(r) * factorial(max(n - r, 1)))

def isPrime(n):
	if n <= 1:
		return False
	if n <= 3:
		return True
	if n % 2 == 0 or n % 3 == 0:
		return False
	i = 5
	while i * i <= n:
		if n % i == 0 or n % (i + 2) == 0:
			return False
		i = i + 6
	return True

def solve():
	(n, x) = sep()
	a = lis()
	a = sorted(a)
	st = 0
	ans = 0
	rem = 0
	for i in range(n - 1, -1, -1):
		temp = ceil(x / a[i])
		if temp == 1:
			ans += 1
			continue
		elif rem >= temp - 1:
			ans += 1
			rem = 0
		else:
			rem += 1
	print(ans)
testcase(int(inp()))


for _ in range(int(input())):
	(n, x) = list(map(int, input().split()))
	arr = list(map(int, input().split()))
	arr.sort()
	cnt = 0
	gp = 0
	for i in range(n - 1, -1, -1):
		gp += 1
		if arr[i] * gp >= x:
			cnt += 1
			gp = 0
	print(cnt)


testcases = int(input())
for _ in range(testcases):
	(n, x) = map(int, input().split())
	a = sorted(list(map(int, input().split())))
	a = a[::-1]
	countr = 0
	pos = 1
	for i in range(n):
		if pos * a[i] >= x:
			countr += 1
			pos = 1
		else:
			pos += 1
	print(countr)


for _ in range(int(input())):
	(n, x) = map(int, input().split())
	skill = [int(e) for e in input().split()]
	skill.sort(reverse=True)
	team = 0
	numMem = 1
	for i in skill:
		if i * numMem >= x:
			team += 1
			numMem = 0
		numMem += 1
	print(team)


t = int(input())
MAX = 9999999999
for _ in range(t):
	(n, x) = map(int, input().split())
	a = list(map(int, input().split()))
	a.sort(reverse=True)
	ans = 0
	current = 0
	cur_min = MAX
	for i in range(n):
		cur_min = min(cur_min, a[i])
		current += 1
		if cur_min * current >= x:
			ans += 1
			cur_min = MAX
			current = 0
	print(ans)


for _ in range(int(input())):
	(n, x) = map(int, input().split())
	Arr = list(map(int, input().split()))
	Arr = sorted(Arr, reverse=True)
	ans = 0
	c = 0
	for i in range(n):
		c += 1
		if c * Arr[i] >= x:
			ans += 1
			c = 0
	print(ans)


def solve():
	(n, x) = map(int, input().split())
	(*a,) = map(int, input().split())
	a.sort()
	ans = 0
	cnt = 0
	for i in range(n - 1, -1, -1):
		cnt += 1
		if a[i] * cnt >= x:
			ans += 1
			cnt = 0
	print(ans)
t = int(input())
for _ in range(t):
	solve()


n = int(input())
for aaa in range(n):
	(a, b) = map(int, input().split())
	l = sorted(list(map(int, input().split())))
	v = 0
	n = 0
	while l:
		a = l.pop()
		v += 1
		if a * v >= b:
			n += 1
			v = 0
	print(n)


for _ in range(int(input())):
	(n, x) = [int(c) for c in input().split()]
	arr = [int(c) for c in input().split()]
	arr.sort(reverse=True)
	ans = 0
	currgroup = 1
	for i in arr:
		if i >= x:
			ans += 1
		elif i * currgroup >= x:
			ans += 1
			currgroup = 1
		else:
			currgroup += 1
	print(ans)


from sys import stdin, stdout
from math import gcd, sqrt
from collections import deque
input = stdin.readline
R = lambda : map(int, input().split())
I = lambda : int(input())
S = lambda : input().rstrip('\n')
L = lambda : list(R())
P = lambda x: stdout.write(x)
lcm = lambda x, y: x * y // gcd(x, y)
hg = lambda x, y: (y + x - 1) // x * x
pw = lambda x: 1 if x == 1 else 1 + pw(x // 2)
chk = lambda x: chk(x // 2) if not x % 2 else True if x == 1 else False
sm = lambda x: (x ** 2 + x) // 2
N = 10 ** 9 + 7
for _ in range(I()):
	(n, k) = R()
	ans = 0
	flg = 0
	for i in sorted(R()):
		if not flg:
			x = (k + i - 1) // i - 1
			if not x:
				ans += 1
			else:
				flg = 1
		else:
			x -= 1
			x = min(x, (k + i - 1) // i - 1)
			if not x:
				ans += 1
				flg = 0
	print(ans)


t = int(input())
for _ in range(t):
	s = input()
	(n, k) = [int(x) for x in s.split()]
	s = input()
	arr = [int(x) for x in s.split()]
	arr.sort()
	count = 0
	j = 1
	for i in range(n - 1, -1, -1):
		if arr[i] * j >= k:
			count += 1
			j = 1
		else:
			j += 1
	print(count)


t = int(input())
while t:
	(n, k) = map(int, input().split())
	a = list(map(int, input().split()))
	a = sorted(a, reverse=True)
	(s, ans) = (1, 0)
	for y in range(n):
		if s * a[y] >= k:
			s = 1
			ans += 1
		else:
			s += 1
	print(ans)
	t -= 1


t = input()
t = int(t)

def solve(n, x, arr):
	arr = sorted(arr, reverse=True)
	n_teams = 0
	cnt = 0
	while cnt < n:
		if arr[cnt] >= x:
			n_teams += 1
			cnt += 1
		else:
			cpk = 1
			while cnt < n and arr[cnt] * cpk < x:
				cpk += 1
				cnt += 1
			if cnt < n and arr[cnt] * cpk >= x:
				n_teams += 1
				cnt += 1
			else:
				break
	print(n_teams)
	return
for i in range(t):
	(n, x) = map(int, input().split())
	arr = list(map(int, input().split()))
	solve(n, x, arr)


import math
for _ in range(int(input())):
	(n, x) = map(int, input().split())
	l = sorted(list(map(int, input().split())), reverse=True)
	i = 0
	c = 0
	while i < n:
		if l[i] >= x:
			i += 1
			c += 1
		else:
			f = 0
			j = i + 1
			p = 1
			while j < n:
				if (p + 1) * l[j] >= x:
					j += 1
					p += 1
					f = 1
					break
				else:
					j += 1
					p += 1
			if f:
				c += 1
			i = j
	print(c)


import math
import heapq, bisect
import sys
from collections import deque, defaultdict
from fractions import Fraction
mod = 10 ** 9 + 7
mod1 = 998244353
import os
import sys
from io import BytesIO, IOBase
BUFSIZE = 8192

class FastIO(IOBase):
	newlines = 0

	def __init__(self, file):
		self._fd = file.fileno()
		self.buffer = BytesIO()
		self.writable = 'x' in file.mode or 'r' not in file.mode
		self.write = self.buffer.write if self.writable else None

	def read(self):
		while True:
			b = os.read(self._fd, max(os.fstat(self._fd).st_size, BUFSIZE))
			if not b:
				break
			ptr = self.buffer.tell()
			(self.buffer.seek(0, 2), self.buffer.write(b), self.buffer.seek(ptr))
		self.newlines = 0
		return self.buffer.read()

	def readline(self):
		while self.newlines == 0:
			b = os.read(self._fd, max(os.fstat(self._fd).st_size, BUFSIZE))
			self.newlines = b.count(b'\n') + (not b)
			ptr = self.buffer.tell()
			(self.buffer.seek(0, 2), self.buffer.write(b), self.buffer.seek(ptr))
		self.newlines -= 1
		return self.buffer.readline()

	def flush(self):
		if self.writable:
			os.write(self._fd, self.buffer.getvalue())
			(self.buffer.truncate(0), self.buffer.seek(0))

class IOWrapper(IOBase):

	def __init__(self, file):
		self.buffer = FastIO(file)
		self.flush = self.buffer.flush
		self.writable = self.buffer.writable
		self.write = lambda s: self.buffer.write(s.encode('ascii'))
		self.read = lambda : self.buffer.read().decode('ascii')
		self.readline = lambda : self.buffer.readline().decode('ascii')
(sys.stdin, sys.stdout) = (IOWrapper(sys.stdin), IOWrapper(sys.stdout))
input = lambda : sys.stdin.readline().rstrip('\r\n')

class TreeNode:

	def __init__(self, k, v):
		self.key = k
		self.value = v
		self.left = None
		self.right = None
		self.parent = None
		self.height = 1
		self.num_left = 1
		self.num_total = 1

class AvlTree:

	def __init__(self):
		self._tree = None

	def add(self, k, v):
		if not self._tree:
			self._tree = TreeNode(k, v)
			return
		node = self._add(k, v)
		if node:
			self._rebalance(node)

	def _add(self, k, v):
		node = self._tree
		while node:
			if k < node.key:
				if node.left:
					node = node.left
				else:
					node.left = TreeNode(k, v)
					node.left.parent = node
					return node.left
			elif node.key < k:
				if node.right:
					node = node.right
				else:
					node.right = TreeNode(k, v)
					node.right.parent = node
					return node.right
			else:
				node.value = v
				return

	@staticmethod
	def get_height(x):
		return x.height if x else 0

	@staticmethod
	def get_num_total(x):
		return x.num_total if x else 0

	def _rebalance(self, node):
		n = node
		while n:
			lh = self.get_height(n.left)
			rh = self.get_height(n.right)
			n.height = max(lh, rh) + 1
			balance_factor = lh - rh
			n.num_total = 1 + self.get_num_total(n.left) + self.get_num_total(n.right)
			n.num_left = 1 + self.get_num_total(n.left)
			if balance_factor > 1:
				if self.get_height(n.left.left) < self.get_height(n.left.right):
					self._rotate_left(n.left)
				self._rotate_right(n)
			elif balance_factor < -1:
				if self.get_height(n.right.right) < self.get_height(n.right.left):
					self._rotate_right(n.right)
				self._rotate_left(n)
			else:
				n = n.parent

	def _remove_one(self, node):
		replacement = node.left or node.right
		if node.parent:
			if AvlTree._is_left(node):
				node.parent.left = replacement
			else:
				node.parent.right = replacement
			replacement.parent = node.parent
			node.parent = None
		else:
			self._tree = replacement
			replacement.parent = None
		node.left = None
		node.right = None
		node.parent = None
		self._rebalance(replacement)

	def _remove_leaf(self, node):
		if node.parent:
			if AvlTree._is_left(node):
				node.parent.left = None
			else:
				node.parent.right = None
			self._rebalance(node.parent)
		else:
			self._tree = None
		node.parent = None
		node.left = None
		node.right = None

	def remove(self, k):
		node = self._get_node(k)
		if not node:
			return
		if AvlTree._is_leaf(node):
			self._remove_leaf(node)
			return
		if node.left and node.right:
			nxt = AvlTree._get_next(node)
			node.key = nxt.key
			node.value = nxt.value
			if self._is_leaf(nxt):
				self._remove_leaf(nxt)
			else:
				self._remove_one(nxt)
			self._rebalance(node)
		else:
			self._remove_one(node)

	def get(self, k):
		node = self._get_node(k)
		return node.value if node else -1

	def _get_node(self, k):
		if not self._tree:
			return None
		node = self._tree
		while node:
			if k < node.key:
				node = node.left
			elif node.key < k:
				node = node.right
			else:
				return node
		return None

	def get_at(self, pos):
		x = pos + 1
		node = self._tree
		while node:
			if x < node.num_left:
				node = node.left
			elif node.num_left < x:
				x -= node.num_left
				node = node.right
			else:
				return (node.key, node.value)
		raise IndexError('Out of ranges')

	@staticmethod
	def _is_left(node):
		return node.parent.left and node.parent.left == node

	@staticmethod
	def _is_leaf(node):
		return node.left is None and node.right is None

	def _rotate_right(self, node):
		if not node.parent:
			self._tree = node.left
			node.left.parent = None
		elif AvlTree._is_left(node):
			node.parent.left = node.left
			node.left.parent = node.parent
		else:
			node.parent.right = node.left
			node.left.parent = node.parent
		bk = node.left.right
		node.left.right = node
		node.parent = node.left
		node.left = bk
		if bk:
			bk.parent = node
		node.height = max(self.get_height(node.left), self.get_height(node.right)) + 1
		node.num_total = 1 + self.get_num_total(node.left) + self.get_num_total(node.right)
		node.num_left = 1 + self.get_num_total(node.left)

	def _rotate_left(self, node):
		if not node.parent:
			self._tree = node.right
			node.right.parent = None
		elif AvlTree._is_left(node):
			node.parent.left = node.right
			node.right.parent = node.parent
		else:
			node.parent.right = node.right
			node.right.parent = node.parent
		bk = node.right.left
		node.right.left = node
		node.parent = node.right
		node.right = bk
		if bk:
			bk.parent = node
		node.height = max(self.get_height(node.left), self.get_height(node.right)) + 1
		node.num_total = 1 + self.get_num_total(node.left) + self.get_num_total(node.right)
		node.num_left = 1 + self.get_num_total(node.left)

	@staticmethod
	def _get_next(node):
		if not node.right:
			return node.parent
		n = node.right
		while n.left:
			n = n.left
		return n
avl = AvlTree()

class SegmentTree1:

	def __init__(self, data, default='z', func=lambda a, b: min(a, b)):
		self._default = default
		self._func = func
		self._len = len(data)
		self._size = _size = 1 << (self._len - 1).bit_length()
		self.data = [default] * (2 * _size)
		self.data[_size:_size + self._len] = data
		for i in reversed(range(_size)):
			self.data[i] = func(self.data[i + i], self.data[i + i + 1])

	def __delitem__(self, idx):
		self[idx] = self._default

	def __getitem__(self, idx):
		return self.data[idx + self._size]

	def __setitem__(self, idx, value):
		idx += self._size
		self.data[idx] = value
		idx >>= 1
		while idx:
			self.data[idx] = self._func(self.data[2 * idx], self.data[2 * idx + 1])
			idx >>= 1

	def __len__(self):
		return self._len

	def query(self, start, stop):
		if start == stop:
			return self.__getitem__(start)
		stop += 1
		start += self._size
		stop += self._size
		res = self._default
		while start < stop:
			if start & 1:
				res = self._func(res, self.data[start])
				start += 1
			if stop & 1:
				stop -= 1
				res = self._func(res, self.data[stop])
			start >>= 1
			stop >>= 1
		return res

	def __repr__(self):
		return 'SegmentTree({0})'.format(self.data)

class SegmentTree:

	def __init__(self, data, default=0, func=lambda a, b: a + b):
		self._default = default
		self._func = func
		self._len = len(data)
		self._size = _size = 1 << (self._len - 1).bit_length()
		self.data = [default] * (2 * _size)
		self.data[_size:_size + self._len] = data
		for i in reversed(range(_size)):
			self.data[i] = func(self.data[i + i], self.data[i + i + 1])

	def __delitem__(self, idx):
		self[idx] = self._default

	def __getitem__(self, idx):
		return self.data[idx + self._size]

	def __setitem__(self, idx, value):
		idx += self._size
		self.data[idx] = value
		idx >>= 1
		while idx:
			self.data[idx] = self._func(self.data[2 * idx], self.data[2 * idx + 1])
			idx >>= 1

	def __len__(self):
		return self._len

	def query(self, start, stop):
		if start == stop:
			return self.__getitem__(start)
		stop += 1
		start += self._size
		stop += self._size
		res = self._default
		while start < stop:
			if start & 1:
				res = self._func(res, self.data[start])
				start += 1
			if stop & 1:
				stop -= 1
				res = self._func(res, self.data[stop])
			start >>= 1
			stop >>= 1
		return res

	def __repr__(self):
		return 'SegmentTree({0})'.format(self.data)

class Factorial:

	def __init__(self, MOD):
		self.MOD = MOD
		self.factorials = [1, 1]
		self.invModulos = [0, 1]
		self.invFactorial_ = [1, 1]

	def calc(self, n):
		if n <= -1:
			print('Invalid argument to calculate n!')
			print('n must be non-negative value. But the argument was ' + str(n))
			exit()
		if n < len(self.factorials):
			return self.factorials[n]
		nextArr = [0] * (n + 1 - len(self.factorials))
		initialI = len(self.factorials)
		prev = self.factorials[-1]
		m = self.MOD
		for i in range(initialI, n + 1):
			prev = nextArr[i - initialI] = prev * i % m
		self.factorials += nextArr
		return self.factorials[n]

	def inv(self, n):
		if n <= -1:
			print('Invalid argument to calculate n^(-1)')
			print('n must be non-negative value. But the argument was ' + str(n))
			exit()
		p = self.MOD
		pi = n % p
		if pi < len(self.invModulos):
			return self.invModulos[pi]
		nextArr = [0] * (n + 1 - len(self.invModulos))
		initialI = len(self.invModulos)
		for i in range(initialI, min(p, n + 1)):
			next = -self.invModulos[p % i] * (p // i) % p
			self.invModulos.append(next)
		return self.invModulos[pi]

	def invFactorial(self, n):
		if n <= -1:
			print('Invalid argument to calculate (n^(-1))!')
			print('n must be non-negative value. But the argument was ' + str(n))
			exit()
		if n < len(self.invFactorial_):
			return self.invFactorial_[n]
		self.inv(n)
		nextArr = [0] * (n + 1 - len(self.invFactorial_))
		initialI = len(self.invFactorial_)
		prev = self.invFactorial_[-1]
		p = self.MOD
		for i in range(initialI, n + 1):
			prev = nextArr[i - initialI] = prev * self.invModulos[i % p] % p
		self.invFactorial_ += nextArr
		return self.invFactorial_[n]

class Combination:

	def __init__(self, MOD):
		self.MOD = MOD
		self.factorial = Factorial(MOD)

	def ncr(self, n, k):
		if k < 0 or n < k:
			return 0
		k = min(k, n - k)
		f = self.factorial
		return f.calc(n) * f.invFactorial(max(n - k, k)) * f.invFactorial(min(k, n - k)) % self.MOD

def powm(a, n, m):
	if a == 1 or n == 0:
		return 1
	if n % 2 == 0:
		s = powm(a, n // 2, m)
		return s * s % m
	else:
		return a * powm(a, n - 1, m) % m

def sort_list(list1, list2):
	zipped_pairs = zip(list2, list1)
	z = [x for (_, x) in sorted(zipped_pairs)]
	return z

def product(l):
	por = 1
	for i in range(len(l)):
		por *= l[i]
	return por

def binarySearchCount(arr, n, key):
	left = 0
	right = n - 1
	count = 0
	while left <= right:
		mid = int((right + left) / 2)
		if arr[mid] <= key:
			count = mid + 1
			left = mid + 1
		else:
			right = mid - 1
	return count

def countdig(n):
	c = 0
	while n > 0:
		n //= 10
		c += 1
	return c

def countGreater(arr, n, k):
	l = 0
	r = n - 1
	leftGreater = n
	while l <= r:
		m = int(l + (r - l) / 2)
		if arr[m] >= k:
			leftGreater = m
			r = m - 1
		else:
			l = m + 1
	return n - leftGreater
for ik in range(int(input())):
	(n, m) = map(int, input().split())
	l = list(map(int, input().split()))
	l.sort()
	ans = 0
	f = -1
	for i in range(n - 1, -1, -1):
		if l[i] >= m:
			ans += 1
		else:
			f = i
			break
	c = 1
	for i in range(f, -1, -1):
		if l[i] * c >= m:
			ans += 1
			c = 1
		else:
			c += 1
	print(ans)


def single_trial(skills, x):
	rev_skills = sorted(skills, reverse=True)
	(mem, count) = (1, 0)
	for s in rev_skills:
		if s * mem >= x:
			count += 1
			mem = 1
		else:
			mem += 1
	return count
t = int(input())
trials = []
trial_skills = []
for i in range(t):
	[n, x] = [int(i) for i in input().split()]
	trials.append([n, x])
	skills = [int(i) for i in input().split()]
	trial_skills.append(skills)
for i in range(t):
	result = single_trial(trial_skills[i], trials[i][1])
	print(result)


for t in range(int(input())):
	(n, x) = map(int, input().split())
	a = list(map(int, input().split()))
	d = 1
	r = 0
	a.sort(reverse=True)
	for i in range(n):
		if a[i] * d >= x:
			r += 1
			d = 1
		else:
			d += 1
	print(r)


t = int(input())
for _ in range(t):
	(n, x) = map(int, input().split(' '))
	arr = list(map(int, input().split(' ')))
	arr.sort(reverse=True)
	count = 0
	teamcount = 0
	for i in range(n):
		teamcount += 1
		if teamcount * arr[i] >= x:
			teamcount = 0
			count += 1
	print(count)


from math import *
t = int(input())
for _ in range(t):
	(n, x) = map(int, input().split())
	a = list(map(int, input().split()))
	c = 0
	ans = 0
	a.sort(reverse=True)
	for i in range(n):
		c = c + 1
		k = a[i] * c
		if k >= x:
			ans = ans + 1
			c = 0
	print(ans)


for t in range(int(input())):
	(n, x) = map(int, input().split())
	a = list(map(int, input().split()))
	a.sort()
	c = 0
	i = n - 1
	while i >= 0:
		prod = a[i]
		if prod >= x:
			c += 1
			i = i - 1
		else:
			test = 0
			j = 1
			while prod < x and j <= i:
				prod = a[i - j] * (j + 1)
				if prod >= x:
					test = 1
				j = j + 1
			if test == 1:
				c += 1
			i = i - j
	print(c)


import time, math as mt, bisect, sys
from sys import stdin, stdout
from collections import deque
from fractions import Fraction
from collections import Counter
from collections import OrderedDict
pi = 3.141592653589793

def II():
	return int(stdin.readline())

def IO():
	return stdin.readline()

def IP():
	return map(int, stdin.readline().split())

def L():
	return list(map(int, stdin.readline().split()))

def P(x):
	return stdout.write(str(x) + '\n')

def PI(x, y):
	return stdout.write(str(x) + ' ' + str(y) + '\n')

def lcm(a, b):
	return a * b // gcd(a, b)

def gcd(a, b):
	if a == 0:
		return b
	elif b == 0:
		return a
	if a > b:
		return gcd(a % b, b)
	else:
		return gcd(a, b % a)

def readTree():
	v = int(input())
	adj = [set() for i in range(v + 1)]
	for i in range(v - 1):
		(u1, u2) = In()
		adj[u1].add(u2)
		adj[u2].add(u1)
	return (adj, v)

def bfs(adj, v):
	visited = [False] * (v + 1)
	q = deque()
	while q:
		pass

def sieve():
	li = [True] * 1000001
	(li[0], li[1]) = (False, False)
	for i in range(2, len(li), 1):
		if li[i] == True:
			for j in range(i * i, len(li), i):
				li[j] = False
	prime = []
	for i in range(1000001):
		if li[i] == True:
			prime.append(i)
	return prime

def setBit(n):
	count = 0
	while n != 0:
		n = n & n - 1
		count += 1
	return count
mx = 10 ** 7
spf = [mx] * (mx + 1)

def SPF():
	spf[1] = 1
	for i in range(2, mx + 1):
		if spf[i] == mx:
			spf[i] = i
			for j in range(i * i, mx + 1, i):
				if i < spf[j]:
					spf[j] = i
	return
mod = 10 ** 9 + 7

def solve():
	(n, x) = IP()
	li = L()
	li.sort(reverse=True)
	curr_len = 1
	team = 0
	for i in range(n):
		if li[i] * curr_len >= x:
			team += 1
			curr_len = 1
		else:
			curr_len += 1
	P(team)
t = II()
for i in range(t):
	solve()


for _ in range(int(input())):
	(n, x) = [int(__) for __ in input().split()]
	a = [int(___) for ___ in input().split()]
	a.sort(reverse=True)
	shit = 1
	ans = 0
	for i in a:
		if shit * i < x:
			shit += 1
		else:
			ans += 1
			shit = 1
	print(ans)


def ans(X, A):
	A = sorted(A)[::-1]
	i = 0
	ret = 0
	curr_length = 0
	curr_min = None
	while i < len(A):
		curr_length += 1
		curr_min = A[i]
		i += 1
		if curr_length * curr_min >= X:
			ret += 1
			curr_length = 0
			curr_min = None
	return ret
T = int(input())
for t in range(T):
	(N, X) = input().split(' ')
	N = int(N)
	X = int(X)
	A = input().split(' ')
	A = list(map(int, A))
	print(ans(X, A))


import math
T = int(input())
for case in range(T):
	value = input().split()
	(n, m) = (int(value[0]), int(value[1]))
	value = input().split()
	value = [int(v) for v in value]
	value = [math.ceil(m / v) for v in value]
	value.sort()
	dp = []
	for i in range(0, n):
		(p1, p2) = (i - value[i], i - 1)
		(v1, v2) = (0, 0)
		if p1 >= 0:
			v1 = dp[p1] + 1
		elif p1 == -1:
			v1 = 1
		if p2 >= 0:
			v2 = dp[p2]
		dp.append(max(v1, v2))
	print(dp[-1])


T = int(input())
for t in range(T):
	(n, x) = map(int, input().split())
	a = list(map(int, input().split()))
	a.sort(reverse=True)
	c = 0
	ans = 0
	for i in range(n):
		c += 1
		if a[i] * c >= x:
			c = 0
			ans += 1
	print(ans)


for _ in range(int(input())):
	(n, x) = [*map(int, input().split())]
	a = [*map(int, input().split())]
	teams = 0
	a.sort(reverse=True)
	pointer = 0
	case = False
	for i in range(0, n):
		if a[i] < x:
			case = True
			l = i
			break
		else:
			teams += 1
	if teams == n:
		print(teams)
	elif case:
		pointer = l
		ans = 0
		mi = 10 ** 9
		count = 0
		for j in range(pointer, n):
			ans += a[j]
			count += 1
			if a[j] < mi:
				mi = a[j]
			if count * mi >= x:
				teams += 1
				ans = 0
				mi = 10 ** 9
				count = 0
		print(teams)
	else:
		pointer = 0
		ans = 0
		mi = 10 ** 9
		count = 0
		for j in range(pointer, n):
			ans += a[j]
			count += 1
			if a[j] < mi:
				mi = a[j]
			if count * mi >= x:
				teams += 1
				ans = 0
				mi = 10 ** 9
				count = 0
		print(teams)


def read_int():
	return int(input().strip())

def read_ints():
	return list(map(int, input().strip().split(' ')))

def solve():
	(n, x) = read_ints()
	a = read_ints()
	a.sort()
	size = 0
	teams = 0
	while len(a) != 0:
		if a.pop() * (size + 1) < x:
			size += 1
		else:
			size = 0
			teams += 1
	return teams
T = read_int()
for _ in range(T):
	print(solve())


from __future__ import division, print_function
import itertools, os, sys, threading
from io import BytesIO, IOBase
if sys.version_info[0] < 3:
	from __builtin__ import xrange as range
	from future_builtins import ascii, filter, hex, map, oct, zip
BUFSIZE = 8192

class FastIO(IOBase):
	newlines = 0

	def __init__(self, file):
		self._fd = file.fileno()
		self.buffer = BytesIO()
		self.writable = 'x' in file.mode or 'r' not in file.mode
		self.write = self.buffer.write if self.writable else None

	def read(self):
		while True:
			b = os.read(self._fd, max(os.fstat(self._fd).st_size, BUFSIZE))
			if not b:
				break
			ptr = self.buffer.tell()
			(self.buffer.seek(0, 2), self.buffer.write(b), self.buffer.seek(ptr))
		self.newlines = 0
		return self.buffer.read()

	def readline(self):
		while self.newlines == 0:
			b = os.read(self._fd, max(os.fstat(self._fd).st_size, BUFSIZE))
			self.newlines = b.count(b'\n') + (not b)
			ptr = self.buffer.tell()
			(self.buffer.seek(0, 2), self.buffer.write(b), self.buffer.seek(ptr))
		self.newlines -= 1
		return self.buffer.readline()

	def flush(self):
		if self.writable:
			os.write(self._fd, self.buffer.getvalue())
			(self.buffer.truncate(0), self.buffer.seek(0))

class IOWrapper(IOBase):

	def __init__(self, file):
		self.buffer = FastIO(file)
		self.flush = self.buffer.flush
		self.writable = self.buffer.writable
		self.write = lambda s: self.buffer.write(s.encode('ascii'))
		self.read = lambda : self.buffer.read().decode('ascii')
		self.readline = lambda : self.buffer.readline().decode('ascii')

def print(*args, **kwargs):
	(sep, file) = (kwargs.pop('sep', ' '), kwargs.pop('file', sys.stdout))
	at_start = True
	for x in args:
		if not at_start:
			file.write(sep)
		file.write(str(x))
		at_start = False
	file.write(kwargs.pop('end', '\n'))
	if kwargs.pop('flush', False):
		file.flush()
if sys.version_info[0] < 3:
	(sys.stdin, sys.stdout) = (FastIO(sys.stdin), FastIO(sys.stdout))
else:
	(sys.stdin, sys.stdout) = (IOWrapper(sys.stdin), IOWrapper(sys.stdout))
from math import sqrt, floor, factorial, gcd, log, ceil
from collections import deque, Counter, defaultdict
from itertools import permutations, combinations
from math import gcd
from bisect import bisect
from random import randrange
input = lambda : sys.stdin.readline().rstrip('\r\n')
read = lambda : list(map(int, input().strip().split(' ')))

def main():
	for _ in range(int(input())):
		(n, x) = read()
		arr = read()
		arr.sort()
		dp = [0] * n
		for i in range(n - 1, -1, -1):
			need = ceil(x / arr[i])
			if i + need - 1 < n:
				if i + need < n:
					dp[i] += 1 + dp[i + need]
				else:
					dp[i] += 1
		print(max(dp))
main()


import math
t = int(input())
for j in range(t):
	(n, x) = map(int, input().split())
	a = list(map(int, input().split()))
	a.sort(reverse=True)
	i = 0
	ans = 0
	c = 1
	while i < n:
		if a[i] * c >= x:
			ans += 1
			c = 0
		i += 1
		c += 1
	print(ans)


import sys
import math
import collections
import heapq

def set_debug(debug_mode=False):
	if debug_mode:
		fin = open('input.txt', 'r')
		sys.stdin = fin

def int_input():
	return list(map(int, input().split()))
t = int(input())
for ti in range(1, t + 1):
	(n, x) = int_input()
	A = int_input()
	A.sort(reverse=True)
	l = 0
	r = 0
	res = 0
	while r < len(A):
		if A[r] * (r - l + 1) >= x:
			l = r + 1
			res += 1
		r += 1
	print(res)


for _ in range(int(input())):
	(n, x) = list(map(int, input().split()))
	arr = list(map(int, input().split()))
	arr.sort(reverse=True)
	haveNow = 1
	teams = 0
	for i in range(1, n):
		if haveNow * arr[i - 1] >= x:
			teams += 1
			haveNow = 1
		else:
			haveNow += 1
	if haveNow * arr[-1] >= x:
		teams += 1
	print(teams)


def make_teams(n, x, skill):
	skill.sort(reverse=True)
	i = 0
	groups = 0
	while i != n:
		team = skill[i]
		mem = 1
		while x > team * mem:
			mem += 1
			i += 1
			if i == n:
				return groups
			team = skill[i]
		groups += 1
		i += 1
	return groups
t = int(input())
for i in range(t):
	(n, x) = map(int, input().split())
	skill = list(map(int, input().split()))
	print(make_teams(n, x, skill))


import sys
input = sys.stdin.readline
I = lambda : list(map(int, input().split()))
(t,) = I()
for i in range(t):
	(n, x) = I()
	l = sorted(I())
	an = 0
	fl = 1
	for i in range(n - 1, -1, -1):
		if l[i] > x:
			an += 1
		elif l[i] * fl >= x:
			an += 1
			fl = 1
		else:
			fl += 1
	print(an)


def cin():
	return map(int, input().split())
for t in range(int(input())):
	(n, x) = cin()
	a = list(cin())
	b = sorted(a, reverse=True)
	ans = 0
	j = 0
	for i in range(n):
		if b[i] * (i - j + 1) >= x:
			ans += 1
			j = i + 1
	print(ans)


from math import *
from collections import *
from bisect import *
import sys
input = sys.stdin.readline
t = int(input())
cc = 0
gg = {'R': 'P', 'S': 'R', 'P': 'S'}
while t:
	t -= 1
	(n, x) = map(int, input().split())
	a = list(map(int, input().split()))
	a.sort(reverse=True)
	(i, j) = (0, n - 1)
	r = 0
	c = 0
	while i < n:
		c += 1
		if c * a[i] >= x:
			r += 1
			c = 0
		i += 1
	print(r)


import bisect
import sys
import math
input = sys.stdin.readline
import functools
from collections import defaultdict

def inp():
	return int(input())

def inlt():
	return list(map(int, input().split()))

def insr():
	s = input()
	return list(s[:len(s) - 1])

def invr():
	return map(int, input().split())

def solve(case):
	[n, x] = inlt()
	aa = inlt()
	aa.sort()
	new_team = n - 1
	res = 0
	for i in range(n - 1, -1, -1):
		if aa[i] * (new_team - i + 1) >= x:
			res += 1
			new_team = i - 1
	return res
if len(sys.argv) > 1 and sys.argv[1].startswith('input'):
	f = open('./' + sys.argv[1], 'r')
	input = f.readline
T = inp()
for i in range(T):
	res = solve(i + 1)
	print(str(res))


t = int(input())
for i in range(t):
	(n, x) = list(map(int, input().split()))
	nums = list(map(int, input().split()))
	nums.sort(reverse=True)
	teams = 0
	team_members = 0
	team_min = float('inf')
	for num in nums:
		team_members += 1
		team_min = min(team_min, num)
		value = team_members * team_min
		if value >= x:
			teams += 1
			team_members = 0
			team_min = float('inf')
	print(teams)


t = int(input())
for ii in range(t):
	(n, x) = map(int, input().split())
	l = list(map(int, input().split()))
	l.sort(reverse=True)
	cnt = 0
	tempMin = l[0]
	tempCnt = 0
	for i in l:
		if tempMin * tempCnt >= x:
			cnt += 1
			tempCnt = 0
		tempMin = i
		tempCnt += 1
	if tempMin * tempCnt >= x:
		cnt += 1
		tempCnt = 0
	print(cnt)


from sys import stdin
input = lambda : stdin.readline().rstrip('\r\n')
from collections import deque as que
from collections import defaultdict as vector
from heapq import *
inin = lambda : int(input())
inar = lambda : list(map(int, input().split()))

def SOLVEA():
	n = inin()
	a = inar()
	for i in range(1, n - 1):
		if a[i - 1] < a[i] > a[i + 1]:
			print('YES')
			print(i, i + 1, i + 2)
			break
	else:
		print('NO')

def SOLVEB():
	s = input()
	n = len(s)
	mc = max(s.count('P'), s.count('S'), s.count('R'))
	if s.count('R') == mc:
		print('P' * n)
	elif s.count('P') == mc:
		print('S' * n)
	else:
		print('R' * n)

def SOLVEC():
	(n, x) = inar()
	arr = inar()
	arr.sort()
	i = n - 1
	ans = 0
	d = 0
	prev = float('inf')
	while i >= 0:
		d += 1
		if arr[i] * d >= x:
			ans += 1
			d = 0
		prev = arr[i]
		i -= 1
	print(ans)
Testcase = inin()
for _ in range(Testcase):
	SOLVEC()


import os
import sys
from math import *
from collections import *
from fractions import *
from bisect import *
from heapq import *
from io import BytesIO, IOBase

def vsInput():
	sys.stdin = open('input.txt', 'r')
	sys.stdout = open('output.txt', 'w')
BUFSIZE = 8192

class FastIO(IOBase):
	newlines = 0

	def __init__(self, file):
		self._fd = file.fileno()
		self.buffer = BytesIO()
		self.writable = 'x' in file.mode or 'r' not in file.mode
		self.write = self.buffer.write if self.writable else None

	def read(self):
		while True:
			b = os.read(self._fd, max(os.fstat(self._fd).st_size, BUFSIZE))
			if not b:
				break
			ptr = self.buffer.tell()
			(self.buffer.seek(0, 2), self.buffer.write(b), self.buffer.seek(ptr))
		self.newlines = 0
		return self.buffer.read()

	def readline(self):
		while self.newlines == 0:
			b = os.read(self._fd, max(os.fstat(self._fd).st_size, BUFSIZE))
			self.newlines = b.count(b'\n') + (not b)
			ptr = self.buffer.tell()
			(self.buffer.seek(0, 2), self.buffer.write(b), self.buffer.seek(ptr))
		self.newlines -= 1
		return self.buffer.readline()

	def flush(self):
		if self.writable:
			os.write(self._fd, self.buffer.getvalue())
			(self.buffer.truncate(0), self.buffer.seek(0))

class IOWrapper(IOBase):

	def __init__(self, file):
		self.buffer = FastIO(file)
		self.flush = self.buffer.flush
		self.writable = self.buffer.writable
		self.write = lambda s: self.buffer.write(s.encode('ascii'))
		self.read = lambda : self.buffer.read().decode('ascii')
		self.readline = lambda : self.buffer.readline().decode('ascii')
(sys.stdin, sys.stdout) = (IOWrapper(sys.stdin), IOWrapper(sys.stdout))
input = lambda : sys.stdin.readline().rstrip('\r\n')

def value():
	return tuple(map(int, input().split()))

def array():
	return [int(i) for i in input().split()]

def Int():
	return int(input())

def Str():
	return input()

def arrayS():
	return [i for i in input().split()]
for _ in range(Int()):
	(n, x) = value()
	a = sorted(array(), reverse=True)
	ans = 0
	t = 1
	for i in a:
		if i * t >= x:
			ans += 1
			t = 0
		t += 1
	print(ans)


t = int(input())
for i in range(t):
	(n, x) = map(int, input().split())
	l = list(map(int, input().split()))
	l.sort()
	temp = []
	minimum = 10000000000
	total = 0
	for j in range(n - 1, -1, -1):
		temp.append(l[j])
		if l[j] < minimum:
			minimum = l[j]
		if len(temp) * minimum >= x:
			temp = []
			total += 1
			minimum = 10000000000
	print(total)


def main():
	for _ in range(int(input())):
		(n, x) = map(int, input().split())
		arr = sorted(list(map(int, input().split())))
		i = 0
		j = n - 1
		cnt = 0
		curr = 1
		while j - curr + 1 >= 0:
			if arr[j - curr + 1] * curr >= x:
				cnt += 1
				j -= curr
			else:
				curr += 1
		print(cnt)
main()


def main():
	(n, m) = map(int, input().split())
	a = list(map(int, input().split()))
	a.sort(reverse=True)
	ans = 0
	cnt = 0
	i = 0
	while i < n:
		cnt += 1
		if cnt * a[i] >= m:
			ans += 1
			cnt = 0
		i += 1
	print(ans)
	return

def test():
	t = int(input())
	while t:
		main()
		t -= 1
test()


def solution(arr, k):
	arr.sort(reverse=True)
	(count, curr) = (0, 1)
	for i in arr:
		if curr * i >= k:
			count = count + 1
			curr = 0
		curr = curr + 1
	return count
for _ in range(int(input())):
	(n, k) = map(int, input().split())
	arr = [int(x) for x in input().split()]
	print(solution(arr, k))


inp = int(input())
while inp != 0:
	inp -= 1
	(x, y) = list(map(int, input().split()))
	ls = sorted(list(map(int, input().split())), reverse=True)
	(iter, awl) = (0, 1)
	for x in ls:
		if x * awl >= y:
			iter += 1
			awl = 0
		awl += 1
	print(iter)


for _ in range(int(input())):
	(a, b) = map(int, input().split())
	li = list(map(int, input().split()))
	li.sort()
	(n, ans) = (0, 0)
	for i in range(a):
		n += 1
		m = li.pop()
		if m * n >= b:
			ans += 1
			n = 0
	print(ans)


from sys import stdin

def r():
	return stdin.readline().strip()

def r_t(tp):
	return map(tp, r().strip().split())

def r_l(tp):
	return list(r_t(tp))

def solve(n, x, A):
	A.sort(reverse=True)
	(i, ans) = (0, 0)
	while i < n and A[i] >= x:
		(ans, i) = (ans + 1, i + 1)
	ini = i - 1
	while i < n:
		if (i - ini) * A[i] >= x:
			(ans, ini) = (ans + 1, i)
		i += 1
	return ans

def main():
	cases = int(r())
	for case in range(cases):
		(n, x) = r_t(int)
		A = r_l(int)
		print(solve(n, x, A))
main()


import bisect
import decimal
from decimal import Decimal
import os
from collections import Counter
import bisect
from collections import defaultdict
import math
import random
import heapq
from math import sqrt
import sys
from functools import reduce, cmp_to_key
from collections import deque
import threading
from itertools import combinations
from io import BytesIO, IOBase
from itertools import accumulate
decimal.getcontext().prec = 46

def primeFactors(n):
	prime = set()
	while n % 2 == 0:
		prime.add(2)
		n = n // 2
	for i in range(3, int(math.sqrt(n)) + 1, 2):
		while n % i == 0:
			prime.add(i)
			n = n // i
	if n > 2:
		prime.add(n)
	return list(prime)

def getFactors(n):
	factors = []
	i = 1
	while i <= math.sqrt(n):
		if n % i == 0:
			if n // i == i:
				factors.append(i)
			else:
				factors.append(i)
				factors.append(n // i)
		i = i + 1
	return factors

def modefiedSieve():
	mx = 10 ** 7 + 1
	sieve = [-1] * mx
	for i in range(2, mx):
		if sieve[i] == -1:
			sieve[i] = i
			for j in range(i * i, mx, i):
				if sieve[j] == -1:
					sieve[j] = i
	return sieve

def SieveOfEratosthenes(n):
	prime = [True for i in range(n + 1)]
	p = 2
	while p * p <= n:
		if prime[p] == True:
			for i in range(p * p, n + 1, p):
				prime[i] = False
		p += 1
	num = []
	for p in range(2, n + 1):
		if prime[p]:
			num.append(p)
	return num

def lcm(a, b):
	return a * b // math.gcd(a, b)

def sort_dict(key_value):
	return sorted(key_value.items(), key=lambda kv: (kv[1], kv[0]), reverse=True)

def list_input():
	return list(map(int, input().split()))

def num_input():
	return map(int, input().split())

def string_list():
	return list(input())

def decimalToBinary(n):
	return bin(n).replace('0b', '')

def binaryToDecimal(n):
	return int(n, 2)

def DFS(n, s, adj):
	visited = [False for i in range(n + 1)]
	stack = []
	stack.append(s)
	while len(stack):
		s = stack[-1]
		stack.pop()
		if not visited[s]:
			visited[s] = True
		for node in adj[s]:
			if not visited[node]:
				stack.append(node)

def maxSubArraySum(a, size):
	maxint = 10 ** 10
	max_so_far = -maxint - 1
	max_ending_here = 0
	for i in range(0, size):
		max_ending_here = max_ending_here + a[i]
		if max_so_far < max_ending_here:
			max_so_far = max_ending_here
		if max_ending_here < 0:
			max_ending_here = 0
	return max_so_far

def lis(arr):
	n = len(arr)
	lis = [1] * n
	for i in range(1, n):
		for j in range(0, i):
			if arr[i] >= arr[j] and lis[i] < lis[j] + 1:
				lis[i] = lis[j] + 1
	maximum = 0
	for i in range(n):
		maximum = max(maximum, lis[i])
	return maximum

def solve():
	(n, x) = num_input()
	arr = sorted(list_input(), reverse=True)
	ans = 0
	while arr != [] and arr[0] >= x:
		ans += 1
		arr.pop(0)
	n = len(arr)
	c = 1
	for i in range(n):
		if arr[i] * c >= x:
			ans += 1
			c = 1
		else:
			c += 1
	print(ans)
t = 1
t = int(input())
for _ in range(t):
	solve()


for _ in range(int(input())):
	(n, k) = map(int, input().split())
	l = list(map(int, input().split()))
	l.sort(reverse=True)
	i = 0
	c = 0
	f = 0
	mn = 10 ** 10
	while i < n:
		if l[i] >= k:
			c += 1
		else:
			f += 1
			if l[i] * f >= k:
				c += 1
				f = 0
		i += 1
	print(c)


t = int(input())
for i in range(t):
	(n, x) = map(int, input().split())
	l = list(map(int, input().split()))
	l.sort(reverse=True)
	c = 0
	if l[0] * n < x:
		print(0)
	else:
		for j in range(n):
			if l[j] < x:
				break
			else:
				c += 1
		k = j
		a = 1
		if k == n - 1:
			print(c)
		else:
			for j in range(k, n):
				if l[j] * a >= x:
					c += 1
					a = 1
					k = j
				else:
					a += 1
			print(c)


t = int(input())
while t:
	t -= 1
	(n, x) = map(int, input().split())
	lis = sorted(list(map(int, input().split())), reverse=True)
	c = 0
	stop = n - 1
	for i in range(n):
		if lis[i] >= x:
			c += 1
		else:
			stop = i
			break
	i = 1
	while stop < n and stop + i < n:
		if i < n and lis[stop + i] * (i + 1) >= x:
			c += 1
			stop += i + 1
			i = 1
		else:
			i += 1
	print(c)


def solve(n, score, seq):
	seq.sort(reverse=True)
	teams = 0
	temp = 0
	for x in seq:
		temp += 1
		if temp * x >= score:
			teams += 1
			temp = 0
	return teams
for _ in range(int(input())):
	(n, score) = list(map(int, input().split()))
	seq = list(map(int, input().split()))
	print(solve(n, score, seq))


def numberofteam(arr):
	count = 0
	arr_re = [arr[i] for i in range(n) if arr[i] < x]
	count += len(arr) - len(arr_re)
	new_arr = sorted(arr_re, reverse=True)
	num = 2
	for i in range(1, len(new_arr)):
		if new_arr[i] * num >= x:
			count += 1
			num = 1
		else:
			num += 1
	print(count)
t = int(input())
for i in range(t):
	nx = list(map(int, input().strip().split()))
	n = int(nx[0])
	x = int(nx[1])
	arr = list(map(int, input().strip().split()))
	numberofteam(arr)


import sys, math, heapq
tc = int(sys.stdin.readline())
for _ in range(tc):
	(n, x) = map(int, sys.stdin.readline().split())
	arr = list(map(int, sys.stdin.readline().split()))
	arr.sort()
	temp = []
	for i in range(n):
		temp.append(math.ceil(x / arr[i]))
	size = n
	ans = 0
	for i in range(n - 1, -1, -1):
		if size - i >= temp[i]:
			ans += 1
			size = i
	print(ans)


t = int(input())

def rec(mn, ind, l, b):
	if ind == 0:
		return 0
	elif mn[ind - 1][0] < l and mn[ind - 1][1] < b:
		return max(rec(mn, ind - 1, l, b), mn[ind - 1][2] + rec(mn, ind - 1, mn[ind - 1][0], mn[ind - 1][1]))
	else:
		return rec(mn, ind - 1, l, b)
for _ in range(t):
	(n, k) = map(int, input().split())
	l = list(map(int, input().split()))
	m = []
	for i in range(len(l)):
		import math
		m.append(math.ceil(k / l[i]))
	m.sort()
	ans = 0
	i = 0
	count = 0
	while i < len(m):
		count += 1
		if m[i] <= count:
			ans += 1
			count = 0
		i += 1
	print(ans)


for t in range(int(input())):
	(n, x) = map(int, input().split())
	a = sorted(list(map(int, input().split())), reverse=True)
	ans = 0
	k = 0
	for i in range(n):
		k += 1
		if a[i] * k >= x:
			ans += 1
			k = 0
	print(ans)


import os
import heapq
import sys
import math
import operator
from collections import defaultdict
from io import BytesIO, IOBase
sys.setrecursionlimit(10 ** 5)

def gcd(a, b):
	if b == 0:
		return a
	else:
		return gcd(b, a % b)

def inpt():
	return [int(k) for k in input().split()]

def main():
	for _ in range(int(input())):
		(n, x) = map(int, input().split())
		ar = inpt()
		ar.sort()
		t = 0
		temp = n
		for i in range(n - 1, -1, -1):
			p = x // ar[i]
			if x % ar[i] != 0:
				p += 1
			if i + p <= temp:
				t += 1
				temp -= p
		print(t)
BUFSIZE = 8192

class FastIO(IOBase):
	newlines = 0

	def __init__(self, file):
		self._fd = file.fileno()
		self.buffer = BytesIO()
		self.writable = 'x' in file.mode or 'r' not in file.mode
		self.write = self.buffer.write if self.writable else None

	def read(self):
		while True:
			b = os.read(self._fd, max(os.fstat(self._fd).st_size, BUFSIZE))
			if not b:
				break
			ptr = self.buffer.tell()
			(self.buffer.seek(0, 2), self.buffer.write(b), self.buffer.seek(ptr))
		self.newlines = 0
		return self.buffer.read()

	def readline(self):
		while self.newlines == 0:
			b = os.read(self._fd, max(os.fstat(self._fd).st_size, BUFSIZE))
			self.newlines = b.count(b'\n') + (not b)
			ptr = self.buffer.tell()
			(self.buffer.seek(0, 2), self.buffer.write(b), self.buffer.seek(ptr))
		self.newlines -= 1
		return self.buffer.readline()

	def flush(self):
		if self.writable:
			os.write(self._fd, self.buffer.getvalue())
			(self.buffer.truncate(0), self.buffer.seek(0))

class IOWrapper(IOBase):

	def __init__(self, file):
		self.buffer = FastIO(file)
		self.flush = self.buffer.flush
		self.writable = self.buffer.writable
		self.write = lambda s: self.buffer.write(s.encode('ascii'))
		self.read = lambda : self.buffer.read().decode('ascii')
		self.readline = lambda : self.buffer.readline().decode('ascii')
(sys.stdin, sys.stdout) = (IOWrapper(sys.stdin), IOWrapper(sys.stdout))
input = lambda : sys.stdin.readline().rstrip('\r\n')
main()


import io
import os
from collections import Counter, defaultdict, deque

def solve(N, threshold, A):
	A.sort(reverse=True)
	teams = [[]]
	for x in A:
		teams[-1].append(x)
		if len(teams[-1]) * x >= threshold:
			teams.append([])
	teams.pop()
	return len(teams)
input = io.BytesIO(os.read(0, os.fstat(0).st_size)).readline
T = int(input())
for t in range(T):
	(N, X) = [int(x) for x in input().split()]
	A = [int(x) for x in input().split()]
	ans = solve(N, X, A)
	print(ans)


from sys import stdin, stdout
from math import gcd, ceil, sqrt
from collections import Counter
from bisect import bisect_left, bisect_right
ii1 = lambda : int(stdin.readline().strip())
is1 = lambda : stdin.readline().strip()
iia = lambda : list(map(int, stdin.readline().strip().split()))
isa = lambda : stdin.readline().strip().split()
mod = 1000000007
tc = ii1()
for _ in range(tc):
	(n, x) = iia()
	arr = sorted(iia())
	cur = count = 0
	while len(arr):
		t = arr.pop()
		cur += 1
		if t * cur >= x:
			count += 1
			cur = 0
	print(count)


for _ in range(int(input())):
	(n, x) = map(int, input().split())
	l = sorted(list(map(int, input().split())), reverse=True)
	s = []
	m = 0
	for i in range(n):
		if l[i] >= x:
			m += 1
		else:
			s.append(l[i])
	slen = len(s)
	i = 0
	j = 1
	while i < slen:
		if s[i] * j >= x:
			m += 1
			j = 0
		j += 1
		i += 1
	print(m)


for _ in range(int(input())):
	(n, x) = map(int, input().split())
	a = list(map(int, input().split()))
	a.sort()
	ans = 0
	ct = 0
	while a:
		ct += 1
		if a.pop() * ct >= x:
			ans += 1
			ct = 0
	print(ans)


t = int(input())
for _ in range(t):
	(n, x) = map(int, input().split())
	a = list(map(int, input().split()))
	a.sort(reverse=True)
	(ans, start) = (0, 0)
	for i in range(n):
		if (i - start + 1) * a[i] >= x:
			start = i + 1
			ans += 1
	print(ans)


import sys, io, os, time
from collections import defaultdict
from collections import OrderedDict
from collections import deque
from itertools import combinations
from itertools import permutations
import bisect, math, heapq
alphabet = 'abcdefghijklmnopqrstuvwxyz'
input = sys.stdin.readline
for ii in range(int(input())):
	(n, x) = map(int, input().split())
	arr = list(map(int, input().split()))
	i = 0
	arr.sort(reverse=True)
	curr = 0
	ans = 0
	grp = 1
	while i < n:
		curr = arr[i] * grp
		if curr >= x:
			ans += 1
			curr = 0
			grp = 0
		i += 1
		grp += 1
	print(ans)


from collections import defaultdict
import math
t = int(input())
for _ in range(t):
	(n, x) = map(int, input().split())
	a = list(map(int, input().split()))
	counts = defaultdict(int)
	for s in a:
		counts[math.ceil(x / s)] += 1
	avail = 0
	teams = 0
	for (members, count) in sorted(counts.items()):
		avail += count
		teams += avail // members
		avail %= members
	print(teams)


t = int(input())
for _ in range(t):
	(n, x) = map(int, input().split())
	a = list(map(int, input().split()))
	a.sort()
	i = n - 1
	n_members = 0
	teams = 0
	while i >= 0:
		n_members += 1
		if a[i] * n_members >= x:
			teams += 1
			n_members = 0
		i -= 1
	print(teams)


tests = int(input())
for t in range(tests):
	(n, x) = list(map(int, input().split()))
	ls = list(map(int, input().split()))
	sorted_ls = sorted(ls)
	sorted_ls = sorted_ls[::-1]
	num = 0
	res = 0
	for item in sorted_ls:
		num += 1
		curr = item * num
		if curr >= x:
			res += 1
			num = 0
	print(res)


T = int(input())
for t in range(T):
	(n, x) = map(int, input().split())
	arr = list(map(int, input().split()))
	arr.sort(reverse=True)
	cnt = 0
	teams = 0
	for no in arr:
		cnt += 1
		if cnt * no >= x:
			teams += 1
			cnt = 0
	print(teams)


dp = list()
m = 0

def left_bound(x):
	m = len(dp)
	L = 0
	R = m - 1
	while L < R:
		M = L + R + 1 >> 1
		if dp[M] >= x:
			R = M - 1
		else:
			L = M
	if dp[L] < x:
		return L
	else:
		return -1

def right_bound(x):
	L = 0
	R = len(dp) - 1
	while L < R:
		M = L + R >> 1
		if dp[M] <= x:
			L = M + 1
		else:
			R = M
	if dp[L] > x:
		return L
	else:
		return len(dp)

def amount(x):
	return right_bound(x) - left_bound(x)

def solve(t):
	if not t:
		return
	dp.clear()
	(n, x) = map(int, input().split())
	a = list(map(int, input().split()))
	for i in range(0, n):
		dp.append(x // a[i] + (not x % a[i] == 0))
	m = len(dp)
	dp.sort()
	res = 0
	cnt = 0
	for i in range(0, m):
		if i > 0 and dp[i] == dp[i - 1]:
			continue
		res += (right_bound(dp[i]) - i + cnt) // dp[i]
		cnt = (right_bound(dp[i]) - i + cnt) % dp[i]
	print(int(res))
	solve(t - 1)
t = int(input())
solve(t)


t = int(input())
for i in range(t):
	(n, x) = map(int, input().split())
	a = [int(x) for x in input().split()]
	a = sorted(a, reverse=True)
	numberOfTeams = 0
	programmerCount = 1
	for s in a:
		if s * programmerCount >= x:
			numberOfTeams += 1
			programmerCount = 0
		programmerCount += 1
	print(numberOfTeams)


ans = ''
for _ in range(int(input())):
	(n, x) = map(int, input().split())
	a = sorted(list(map(int, input().split())))
	i = 0
	j = n - 1
	cnt = 0
	p = 1
	m = a[j]
	while j > -1:
		if p * m >= x:
			cnt += 1
			p = 0
		j -= 1
		p += 1
		m = a[j]
	ans += str(cnt) + '\n'
print(ans)


for _ in range(int(input())):
	(n, x) = map(int, input().split())
	a = sorted([*map(int, input().split())])
	ans = 0
	tnum = 0
	while a:
		tnum += 1
		if a.pop() * tnum >= x:
			ans += 1
			tnum = 0
	print(ans)


import sys
input = sys.stdin.buffer.readline

def solution():
	for _ in range(int(input())):
		(n, m) = map(int, input().split())
		l = list(map(int, input().split()))
		l.sort()
		a = []
		for i in range(n):
			x = m // l[i]
			if x * l[i] < m:
				x += 1
			a.append(x - 1)
		cnt = 0
		ans = 0
		for i in range(n - 1, -1, -1):
			if a[i] <= cnt:
				cnt = 0
				ans += 1
			else:
				cnt += 1
		print(ans)
solution()


gans = []
for _ in range(int(input())):
	(n, x) = map(int, input().split())
	u = list(map(int, input().split()))
	u.sort()
	cur = n - 1
	ans = 0
	cnt = 1
	while cur >= 0:
		if cnt * u[cur] >= x:
			ans += 1
			cnt = 0
		cur -= 1
		cnt += 1
	gans.append(ans)
print('\n'.join(map(str, gans)))


def teams(n, x, a):
	A = sorted(a, reverse=True)
	(cnt, cur) = (0, 1)
	for i in A:
		if i * cur >= x:
			cnt += 1
			cur = 0
		cur += 1
	return cnt
t = int(input())
for _ in range(t):
	(n, x) = map(int, input().split())
	a = list(map(int, input().split()))
	print(teams(n, x, a))


import bisect
t = int(input())
k = 0
for i in range(t):
	len = 0
	total = 0
	(n, s) = map(int, input().split())
	ls = list(map(int, input().split()))
	ls.sort(reverse=True)
	for i in ls:
		len += 1
		if len * i >= s:
			total += 1
			len = 0
	print(total)


for _ in range(int(input())):
	(n, k) = map(int, input().split())
	arr = list(map(int, input().split()))
	arr.sort(reverse=True)
	i = 0
	teams = 0
	teamMem = 0
	while i < len(arr):
		if (teamMem + 1) * arr[i] >= k:
			teams += 1
			teamMem = 0
		else:
			teamMem += 1
		i += 1
	print(teams)


for _ in range(int(input())):
	(n, x) = map(int, input().split())
	a = list(map(int, input().split()))
	a.sort(reverse=True)
	(count, curr) = (0, 1)
	for i in a:
		if i * curr >= x:
			count += 1
			curr = 0
		curr += 1
	print(count)


import sys
input = sys.stdin.readline
MOD = 1000000007
MOD2 = 998244353
ii = lambda : int(input().strip('\n'))
si = lambda : input().strip('\n')
dgl = lambda : list(map(int, input().strip('\n')))
f = lambda : map(int, input().strip('\n').split())
il = lambda : list(map(int, input().strip('\n').split()))
ls = lambda : list(input().strip('\n'))
lsc = lambda : list(input().strip('\n').split(' '))
lsi = lambda : [int(i) for i in ls()]
let = 'abcdefghijklmnopqrstuvwxyz'
for _ in range(ii()):
	(n, x) = f()
	l = sorted(il(), reverse=True)
	ans = 0
	(cnt, temp) = (0, 0)
	for i in range(n):
		cnt += 1
		temp = l[i]
		if temp * cnt >= x:
			cnt = 0
			ans += 1
	print(ans)


t = int(input())
for _ in range(t):
	(n, x) = map(int, input().split())
	a = list(map(int, input().split()))
	a.sort(reverse=True)
	c = 0
	i = 0
	while i < n and a[i] >= x:
		c += 1
		i += 1
	sz = 1
	while i < n:
		if sz * a[i] >= x:
			c += 1
			i += 1
			sz = 1
		else:
			i += 1
			sz += 1
	print(c)


t = int(input())
for k in range(t):
	(n, x) = list(map(int, input().split(' ')))
	a = list(map(int, input().split(' ')))
	a.sort(reverse=True)
	c = 0
	arr = []
	s = 0
	for i in range(0, n, 1):
		if a[i] >= x:
			c += 1
		else:
			m = a[i]
			s += 1
			if s * m >= x:
				c += 1
				s = 0
	print(c)


import math
from decimal import *
import random
mod = int(1000000000.0) + 7
for _ in range(int(input())):
	(n, k) = map(int, input().split())
	arr = sorted(list(map(int, input().split())), reverse=True)
	ans = 0
	tmp = 0
	mult = 1
	for i in range(n):
		if arr[i] >= k:
			ans += 1
		elif arr[i] * mult >= k:
			ans += 1
			mult = 1
		else:
			mult += 1
	print(ans)


import sys
input = sys.stdin.readline

def ceil(x):
	if x != int(x):
		x = int(x) + 1
	return x

def swaparr(arr, a, b):
	temp = arr[a]
	arr[a] = arr[b]
	arr[b] = temp

def gcd(a, b):
	if b == 0:
		return a
	return gcd(b, a % b)

def nCr(n, k):
	if k > n - k:
		k = n - k
	res = 1
	for i in range(k):
		res = res * (n - i)
		res = res / (i + 1)
	return int(res)

def upper_bound(a, x, lo=0, hi=None):
	if hi == None:
		hi = len(a)
	while lo < hi:
		mid = (lo + hi) // 2
		if a[mid] < x:
			lo = mid + 1
		else:
			hi = mid
	return lo

def primefs(n):
	primes = {}
	while n % 2 == 0 and n > 0:
		primes[2] = primes.get(2, 0) + 1
		n = n // 2
	for i in range(3, int(n ** 0.5) + 2, 2):
		while n % i == 0 and n > 0:
			primes[i] = primes.get(i, 0) + 1
			n = n // i
	if n > 2:
		primes[n] = primes.get(n, 0) + 1
	return primes

def power(x, y, p):
	res = 1
	x = x % p
	if x == 0:
		return 0
	while y > 0:
		if y & 1 == 1:
			res = res * x % p
		y = y >> 1
		x = x * x % p
	return res

def swap(a, b):
	temp = a
	a = b
	b = temp
	return (a, b)

def find(x, link):
	p = x
	while p != link[p]:
		p = link[p]
	while x != p:
		nex = link[x]
		link[x] = p
		x = nex
	return p

def union(x, y, link, size):
	x = find(x, link)
	y = find(y, link)
	if size[x] < size[y]:
		(x, y) = swap(x, y)
	if x != y:
		size[x] += size[y]
		link[y] = x

def sieve(n):
	prime = [True for i in range(n + 1)]
	p = 2
	while p * p <= n:
		if prime[p] == True:
			for i in range(p * p, n + 1, p):
				prime[i] = False
		p += 1
	return prime
MAXN = int(100000.0 + 5)

def spf_sieve():
	spf[1] = 1
	for i in range(2, MAXN):
		spf[i] = i
	for i in range(4, MAXN, 2):
		spf[i] = 2
	for i in range(3, ceil(MAXN ** 0.5), 2):
		if spf[i] == i:
			for j in range(i * i, MAXN, i):
				if spf[j] == j:
					spf[j] = i

def factoriazation(x):
	ret = {}
	while x != 1:
		ret[spf[x]] = ret.get(spf[x], 0) + 1
		x = x // spf[x]
	return ret

def int_array():
	return list(map(int, input().strip().split()))

def str_array():
	return input().strip().split()
MOD = int(1000000000.0) + 7
CMOD = 998244353
INF = float('inf')
NINF = -float('inf')
for _ in range(int(input())):
	(n, x) = int_array()
	a = sorted(int_array())
	ans = 0
	while a and a[-1] >= x:
		ans += 1
		a.pop()
	num = 0
	t = INF
	while a:
		num += 1
		t = min(a.pop(), t)
		if num * t >= x:
			ans += 1
			num = 0
			t = INF
	print(ans)


for _ in range(int(input())):
	(n, x) = map(int, input().split())
	a = list(map(int, input().split()))
	a.sort(reverse=True)
	c = 0
	mini = a[0]
	mem = 1
	j = 0
	while j < n:
		if mini * mem >= x:
			c += 1
			j += 1
			if j < n:
				mini = a[j]
				mem = 1
				continue
		else:
			j += 1
			if j < n:
				mini = a[j]
			mem += 1
	print(c)


t = int(input())
for _ in range(t):
	(n, x) = list(map(int, input().split()))
	l = list(map(int, input().split()))
	l.sort(reverse=True)
	out = 0
	count = 0
	for v in l:
		if v * (count + 1) >= x:
			out += 1
			count = 0
		else:
			count += 1
	print(out)


t = int(input())
while t:
	(n, x) = map(int, input().split())
	a = list(map(int, input().split()))
	a.sort()
	count = 0
	mul = 1
	for i in range(n - 1, -1, -1):
		if a[i] * mul >= x:
			count = count + 1
			mul = 1
		else:
			mul = mul + 1
	print(count)
	t = t - 1


for _ in range(int(input())):
	(n, x) = map(int, input().split())
	arr = list(sorted(map(int, input().split())))[::-1]
	mini = arr[0]
	(p, ans, team) = (0, 0, 1)
	while p < n:
		mini = arr[p]
		if mini * team < x:
			team += 1
		else:
			ans += 1
			team = 1
		p += 1
	print(ans)


for _ in range(int(input())):
	(n, x) = map(int, input().split())
	a = sorted(list(map(int, input().split())), reverse=True)
	(team, group) = (0, 1)
	for s in a:
		if s * group >= x:
			team += 1
			group = 0
		group += 1
	print(team)


c = int(input())
for _ in range(c):
	(n, x) = map(int, input().split())
	arr = [int(x) for x in input().split()]
	arr.sort()
	quota = 0
	res = 0
	for i in range(n - 1, -1, -1):
		quota += 1
		req = -(x // -arr[i])
		if quota >= req:
			quota = 0
			res += 1
	print(res)


t = int(input())
for _ in range(t):
	(n, x) = map(int, input().split())
	l = list(map(int, input().split()))
	l = sorted(l)[::-1]
	l.append(1999999999)
	teams = 0
	cnt = 0
	for i in range(n):
		cnt += 1
		if l[i] * cnt >= x:
			cnt = 0
			teams += 1
	print(teams)


import math
for _ in range(int(input())):
	(n, x) = map(int, input().split())
	ai = list(map(int, input().split()))
	xi = sorted(ai)
	ans = 0
	index = 0
	flag = 0
	for i in range(n - 1, -1, -1):
		if xi[i] >= x:
			ans += 1
		else:
			index = i
			val = i + 1
			flag = 1
			break
	if flag == 1:
		zi = []
		while index >= 0:
			zi.append(xi[index])
			if zi[-1] * len(zi) >= x:
				ans += 1
				zi = []
			index -= 1
	print(ans)


for _ in range(int(input())):
	(n, x) = map(int, input().split())
	a = map(int, input().split())
	b = sorted(map(lambda v: (x - 1) // v + 1, a))
	res = 0
	pos = -1
	cur = 1
	while cur + pos < n:
		if b[cur + pos] <= cur:
			pos += cur
			res += 1
		else:
			cur += 1
	print(res)


for _ in range(int(input())):
	(n, m) = map(int, input().split())
	s = sorted(list(map(int, input().split())), reverse=True)
	x = 0
	t = 0
	for i in range(n):
		x += 1
		if s[i] * x >= m:
			x = 0
			t += 1
	print(t)


from os import path
import sys, time
from math import ceil, floor, gcd, log, log2, factorial
from collections import defaultdict, Counter, OrderedDict, deque
from functools import reduce
from operator import mul
maxx = float('inf')
I = lambda : int(sys.stdin.buffer.readline())
tup = lambda : map(int, sys.stdin.buffer.readline().split())
lint = lambda : [int(x) for x in sys.stdin.buffer.readline().split()]
S = lambda : sys.stdin.readline().strip('\n')
grid = lambda r: [lint() for i in range(r)]
stpr = lambda x: sys.stdout.write(f'{x}' + '\n')
star = lambda x: print(' '.join(map(str, x)))
localsys = 0
start_time = time.time()
if path.exists('input.txt'):
	sys.stdin = open('input.txt', 'r')
	sys.stdout = open('output.txt', 'w')
for _ in range(I()):
	(n, x) = tup()
	ls = lint()
	arr = [i for i in ls if i < x]
	ans = n - len(arr)
	arr.sort(reverse=True)
	c = 1
	for i in arr:
		if i * c >= x:
			ans += 1
			c = 0
		c += 1
	print(ans)
if localsys:
	print('\n\nTime Elased :', time.time() - start_time, 'seconds')


import sys
from collections import defaultdict as dd
from collections import deque
from fractions import Fraction as f
from copy import *
from bisect import *
from heapq import *
from math import *
from itertools import permutations

def eprint(*args):
	print(*args, file=sys.stderr)
zz = 1
if zz:
	input = sys.stdin.readline
else:
	sys.stdin = open('input.txt', 'r')
	sys.stdout = open('all.txt', 'w')

def li():
	return [int(x) for x in input().split()]

def fli():
	return [float(x) for x in input().split()]

def comp(a, b):
	if a > b:
		return 2
	return 2 if a == b else 0

def gi():
	return [x for x in input().split()]

def fi():
	return int(input())

def swap(a, i, j):
	(a[i], a[j]) = (a[j], a[i])

def si():
	return list(input().rstrip())

def mi():
	return map(int, input().split())

def gh():
	sys.stdout.flush()

def graph(n, m):
	for i in range(m):
		(x, y) = mi()
		a[x].append(y)
		a[y].append(x)

def bo(i):
	return ord(i) - ord('a')
t = fi()
while t > 0:
	t -= 1
	(n, x) = mi()
	a = li()
	a.sort(reverse=True)
	i = c = 0
	j = -1
	while i < n:
		if a[i] * (i - j) >= x:
			c += 1
			j = i
		i += 1
	print(c)


def fast(arr, x):
	result = 0
	arr.sort(reverse=True)
	minNum = float('inf')
	currLen = 0
	rollingVal = 0
	for num in arr:
		minNum = min(minNum, num)
		currLen += 1
		rollingVal = currLen * minNum
		if rollingVal >= x:
			result += 1
			minNum = float('inf')
			currLen = 0
			rollingVal = 0
	return result

def main():
	t = int(input())
	for _ in range(t):
		(n, x) = [int(x) for x in input().split()]
		arr = [int(x) for x in input().split()]
		result = fast(arr, x)
		print(result)
main()


for _ in range(int(input())):
	(n, x) = map(int, input().split())
	skills = list(map(int, input().split()))
	skills = sorted(skills, reverse=True)
	res = 0
	count = 0
	curmin = 0
	for i in range(n):
		curmin = skills[i]
		count += 1
		if count * curmin >= x:
			res += 1
			count = 0
			curmin = 0
	print(res)


t = int(input())
for _ in range(t):
	(n, x) = map(int, input().split())
	a = list(map(int, input().split()))
	a.sort(reverse=True)
	teams = 0
	team_size = 0
	for i in a:
		if (team_size + 1) * i < x:
			team_size += 1
		else:
			teams += 1
			team_size = 0
	print(teams)


def solve(arr, x):
	arr.sort(reverse=True)
	cnt = 0
	temp = []
	i = 0
	while i < len(arr):
		temp.append(arr[i])
		if temp[-1] * len(temp) >= x:
			cnt += 1
			temp.clear()
			i += 1
		else:
			i += 1
	print(cnt)

def main():
	t = int(input())
	for i in range(t):
		(n, x) = list(map(int, input().split()))
		solve(list(map(int, input().split())), x)
main()


list_ans = []
for _ in range(int(input())):
	(n, x) = map(int, input().split())
	list1 = list(map(int, input().split()))
	list1.sort(reverse=True)
	b = 0
	ans = 0
	for i in range(n):
		a = list1[i]
		b += 1
		if a * b >= x:
			ans += 1
			b = 0
	list_ans.append(ans)
print(*list_ans, sep='\n')


import math
t = int(input())

def fun(n, x, a):
	ans = 0
	i = n - 1
	while i >= 0:
		k = math.ceil(x / a[i])
		if n - i >= k:
			ans += 1
			n -= k
		i -= 1
	print(ans)
while t:
	t -= 1
	(n, x) = map(int, input().split())
	a = [int(i) for i in input().split()]
	a.sort()
	fun(n, x, a)


def test(a, n, x):
	a = sorted(a, reverse=True)
	(cur, res) = (1, 0)
	for i in a:
		if cur * i >= x:
			res += 1
			cur = 0
		cur += 1
	return res
t = int(input())
res = [0] * t
for i in range(t):
	(n, x) = map(int, input().split())
	a = list(map(int, input().strip().split()))[:n]
	res[i] = test(a, n, x)
for i in range(t):
	print(res[i])


from sys import stdin

def mp():
	return map(int, stdin.readline().split())

def ml():
	return list(map(int, stdin.readline().split()))
for _ in range(int(input())):
	(n, x) = mp()
	a = ml()
	a.sort(reverse=True)
	ans = 0
	c = 0
	for num in a:
		c += 1
		if c * num >= x:
			ans += 1
			c = 0
	print(ans)


for _ in range(int(input())):
	(n, x) = map(int, input().split())
	a = sorted(list(map(int, input().split())), reverse=True)
	(ans, cur) = (0, 1)
	for d in a:
		if d * cur >= x:
			ans += 1
			cur = 0
		cur += 1
	print(ans)


t = int(input())
for _ in range(t):
	(n, x) = map(int, input().split())
	arr = list(map(int, input().split()))
	arr.sort()
	start = n - 1
	cur = n - 1
	count = 0
	while cur >= 0:
		if (start - cur + 1) * arr[cur] < x:
			cur -= 1
		else:
			if cur >= 0:
				count += 1
			cur -= 1
			start = cur
	print(count)


from os import path
import sys, time
mod = int(1000000000.0 + 7)
from math import ceil, floor, gcd, log, log2, factorial, sqrt
from collections import defaultdict, Counter, OrderedDict, deque
from itertools import combinations, permutations
from string import ascii_lowercase, ascii_uppercase
from bisect import *
from functools import reduce
from operator import mul
maxx = float('inf')
I = lambda : int(sys.stdin.buffer.readline())
lint = lambda : [int(x) for x in sys.stdin.buffer.readline().split()]
S = lambda : sys.stdin.readline().strip('\n')
grid = lambda r: [lint() for i in range(r)]
localsys = 0
start_time = time.time()
nCr = lambda n, r: reduce(mul, range(n - r + 1, n + 1), 1) // factorial(r)

def ceill(n, x):
	return (n + x - 1) // x
T = 1

def solve():
	(n, x) = lint()
	a = sorted(lint())
	ans = 0
	while a and a[-1] >= x:
		a.pop()
		ans += 1
	n = len(a)
	j = n - 1
	i = 0
	while i < j:
		while i < j and 2 * a[i] < x:
			i += 1
		if i < j and 2 * a[i] >= x:
			a[i] = a[j] = -1
			ans += 1
			i += 1
		j -= 1
	t = 0
	mi = maxx
	cnt = 0
	for i in range(n - 1, -1, -1):
		if a[i] != -1:
			mi = min(mi, a[i])
			cnt += 1
		if mi * cnt >= x:
			t += 1
			mi = maxx
			cnt = 0
	f = 0
	mi = maxx
	cnt = 0
	for i in range(n - 1):
		if a[i] != -1:
			mi = min(mi, a[i])
			cnt += 1
		if mi * cnt >= x:
			f += 1
			mi = maxx
			cnt = 0
	print(ans + max(f, t))

def run():
	if path.exists('input.txt'):
		sys.stdin = open('input.txt', 'r')
		sys.stdout = open('output.txt', 'w')
run()
T = I() if T else 1
for _ in range(T):
	solve()
if localsys:
	print('\n\nTime Elased :', time.time() - start_time, 'seconds')


n = int(input())
for i in range(n):
	(a, b) = map(int, input().split())
	c = sorted(list(map(int, input().split())))
	j = 0
	count = 0
	m = 0
	k = 0
	for j in range(a - 1, -1, -1):
		if c[j] >= b:
			count = count + 1
		else:
			k = k + 1
			if c[j] * k >= b:
				k = 0
				count = count + 1
	print(count)


import math
testCases = int(input())
for _ in range(testCases):
	(n, k) = list(map(int, input().split()))
	nums = list(map(int, input().split()))
	dct = {}
	for i in nums:
		temp = math.ceil(k / i)
		if temp not in dct:
			dct[temp] = 1
		else:
			dct[temp] += 1
	items = dct.items()
	items = list(map(list, items))
	items.sort(key=lambda x: x[0])
	count = 0
	while len(items) > 1:
		(var1, var2) = items.pop(0)
		count += var2 // var1
		items[0][1] += var2 % var1
	(var1, var2) = items.pop(0)
	count += var2 // var1
	print(count)


import math
t = int(input())
for you in range(t):
	l = input().split()
	n = int(l[0])
	x = int(l[1])
	l = input().split()
	li = [int(i) for i in l]
	li.sort()
	ans = 0
	curr = 0
	for i in range(n - 1, -1, -1):
		z = math.ceil(x / li[i])
		if z <= n - i - curr:
			ans += 1
			curr += z
	print(ans)


for t in range(0, int(input())):
	(n, x) = map(int, input().split())
	a = sorted(list(map(int, input().split())))
	count = 0
	aws = 0
	for i in range(n - 1, -1, -1):
		count += 1
		if a[i] * count >= x:
			aws += 1
			count = 0
	print(aws)


import sys

def solve(n, min_skill, skills):
	team_count = 1
	maximum_teams = 0
	skills.sort(reverse=True)
	for i in range(n):
		if skills[i] * team_count >= min_skill:
			maximum_teams += 1
			team_count = 1
		else:
			team_count += 1
	return maximum_teams
take = sys.stdin.readline
for _ in range(int(take())):
	(n, min_skill) = tuple(map(int, take().split()))
	skills = list(map(int, take().split()))
	result = solve(n, min_skill, skills)
	print(result)


for _ in ' ' * int(input()):
	(a, b) = map(int, input().split())
	z = sorted(map(int, input().split()), reverse=True)
	s = c = 0
	for i in range(a):
		c += 1
		if c * z[i] >= b:
			s += 1
			c = 0
	print(s)


n = int(input())
for i in range(n):
	(cnt, cur) = (0, 1)
	(a, b) = map(int, input().split())
	l = list(map(int, input().split()))[:a]
	l.sort(reverse=True)
	k = 0
	for x in l:
		if x * cur >= b:
			cnt = cnt + 1
			cur = 0
		cur += 1
	print(cnt)


from sys import stdin
input = stdin.readline
for _ in range(int(input())):
	(n, x) = map(int, input().split())
	a = sorted(map(int, input().split()), reverse=True)
	p = -1
	cnt = 0
	for i in range(n):
		if (i - p) * a[i] >= x:
			cnt += 1
			p = i
	print(cnt)


for _ in range(int(input())):
	(n, k) = list(map(int, input().split()))
	a = list(map(int, input().split()))
	a.sort(reverse=True)
	i = 0
	x = 0
	z = 0
	while i < n:
		c = a[i]
		x += 1
		if c * x >= k:
			x = 0
			z += 1
		i += 1
	print(z)


for _ in range(int(input())):
	(m, x) = map(int, input().split())
	arr = list(map(int, input().split()))
	arr = sorted(arr)
	(ans, n) = (0, 0)
	for i in range(len(arr) - 1, -1, -1):
		if arr[i] >= x:
			ans += 1
			n = 0
		else:
			n += 1
			if arr[i] * n >= x:
				ans += 1
				n = 0
	print(ans)


import os
import sys
from io import BytesIO, IOBase
BUFSIZE = 8192

class FastIO(IOBase):
	newlines = 0

	def __init__(self, file):
		self._fd = file.fileno()
		self.buffer = BytesIO()
		self.writable = 'x' in file.mode or 'r' not in file.mode
		self.write = self.buffer.write if self.writable else None

	def read(self):
		while True:
			b = os.read(self._fd, max(os.fstat(self._fd).st_size, BUFSIZE))
			if not b:
				break
			ptr = self.buffer.tell()
			(self.buffer.seek(0, 2), self.buffer.write(b), self.buffer.seek(ptr))
		self.newlines = 0
		return self.buffer.read()

	def readline(self):
		while self.newlines == 0:
			b = os.read(self._fd, max(os.fstat(self._fd).st_size, BUFSIZE))
			self.newlines = b.count(b'\n') + (not b)
			ptr = self.buffer.tell()
			(self.buffer.seek(0, 2), self.buffer.write(b), self.buffer.seek(ptr))
		self.newlines -= 1
		return self.buffer.readline()

	def flush(self):
		if self.writable:
			os.write(self._fd, self.buffer.getvalue())
			(self.buffer.truncate(0), self.buffer.seek(0))

class IOWrapper(IOBase):

	def __init__(self, file):
		self.buffer = FastIO(file)
		self.flush = self.buffer.flush
		self.writable = self.buffer.writable
		self.write = lambda s: self.buffer.write(s.encode('ascii'))
		self.read = lambda : self.buffer.read().decode('ascii')
		self.readline = lambda : self.buffer.readline().decode('ascii')
(sys.stdin, sys.stdout) = (IOWrapper(sys.stdin), IOWrapper(sys.stdout))
input = lambda : sys.stdin.readline().rstrip('\r\n')
testcases = int(input())
for j in range(testcases):
	(n, x) = map(int, input().split())
	skill = list(map(int, input().split()))
	skill.sort()
	length = 0
	minsofar = skill[n - 1]
	team = 0
	for s in range(n - 1, -1, -1):
		length += 1
		minsofar = skill[s]
		if length * minsofar >= x:
			team += 1
			length = 0
			minsofar = 0
		else:
			continue
	print(team)


t = int(input())
for _ in range(t):
	(n, x) = list(map(int, input().split()))
	l = list(map(int, input().split()))
	l.sort(reverse=True)
	count = 0
	team_count = 0
	for person_power in l:
		team_count += 1
		power = person_power * team_count
		if power >= x:
			count += 1
			team_count = 0
	print(count)


from collections import defaultdict as dd
import sys
input = sys.stdin.readline
t = int(input())
while t:
	(n, x) = map(int, input().split())
	l = list(map(int, input().split()))
	l.sort()
	j = n - 1
	cou = 0
	mi = l[n - 1]
	ans = 0
	while j >= 0:
		cou += 1
		if l[j] * cou >= x:
			ans += 1
			cou = 0
		j -= 1
	print(ans)
	t -= 1


import math
test = int(input())
for _ in range(test):
	(n, x) = map(int, input().split())
	arr = input().split()
	table = {}
	for i in range(n):
		r = math.ceil(x / int(arr[i]))
		if r == 0:
			r = 1
		if r not in table.keys():
			table[r] = 1
		else:
			table[r] += 1
	count = 0
	rem = 0
	for i in sorted(table):
		if i in table.keys():
			count += (table[i] + rem) // i
			rem = (table[i] + rem) % i
	print(count)


def solve():
	global N, X, A
	A.sort(reverse=True)
	i = 0
	sol = 0
	skill = None
	membs = 0
	while i < len(A):
		if skill is not None and skill * membs >= X:
			sol += 1
			membs = 0
			skill = None
		skill = A[i] if skill is None else min(skill, A[i])
		membs += 1
		i += 1
	return sol + int(skill is not None and skill * membs >= X)
for _ in range(int(input())):
	(N, X) = map(int, input().split())
	A = list(map(int, input().split()))
	sol = solve()
	print(sol)


for t in range(int(input())):
	(n, x) = map(int, input().split())
	l = list(map(int, input().split()))
	l.sort()
	l.reverse()
	res = 0
	j = 1
	for i in l:
		if i * j >= x:
			res += 1
			j = 0
		j += 1
	print(res)


for _ in range(int(input())):
	(n, x) = map(int, input().split())
	l = list(map(int, input().split()))
	l.sort()
	i = n - 1
	ans = 0
	while i >= 0:
		j = i
		c = 1
		while j >= 0 and l[j] * c < x:
			c += 1
			j -= 1
		if j >= 0 and l[j] * c >= x:
			ans += 1
			j -= 1
		i = j
	print(ans)


from sys import stdin, stdout
import math
input = stdin.readline

def print(x='', y='', end='\n'):
	if y == '':
		stdout.write(str(x) + end)
	else:
		stdout.write(str(x) + ' ' + str(y) + end)

def solve():
	(n, x) = map(int, input().split())
	l = list(map(int, input().split()))
	l.sort(reverse=True)
	(ans, cnt) = (0, 1)
	for i in l:
		if i * cnt >= x:
			ans += 1
			cnt = 1
			continue
		cnt += 1
	print(ans)
tt = 1
tt = int(input())
for __ in range(tt):
	solve()


t = int(input())
for i in range(t):
	(n, x) = map(int, input().split())
	a = list(map(int, input().split()))
	a.sort()
	curr = 1
	s = 0
	for i in range(n - 1, -1, -1):
		if a[i] * curr >= x:
			curr = 1
			s += 1
		else:
			curr += 1
	print(s)


for _ in range(int(input())):
	nx = list(map(int, input().strip().split()))
	(n, x) = (nx[0], nx[1])
	li = list(map(int, input().strip().split()))
	li.sort()
	p = list(reversed(li))
	(temp, maxi) = (1, 0)
	for i in range(n):
		if p[i] * temp >= x:
			maxi += 1
			temp = 1
		else:
			temp += 1
	print(maxi)


for _ in range(int(input())):
	(n, x) = map(int, input().split())
	a = sorted(list(map(int, input().split())), reverse=True)
	i = 0
	ans = 0
	curr = 0
	while i < n:
		curr += 1
		if curr * a[i] >= x:
			ans += 1
			curr = 0
		i += 1
	print(ans)


t = int(input())
ans = []
for _ in range(t):
	a = input().split(' ')
	n = int(a[0])
	x = int(a[1])
	arr = input().split(' ')
	for i in range(n):
		arr[i] = int(arr[i])
	arr = sorted(arr, reverse=True)
	count = 0
	mini = 1000000000
	nos = 0
	for i in range(n):
		nos += 1
		mini = min(mini, arr[i])
		if mini * nos >= x:
			count += 1
			nos = 0
			mini = 9999999999
	ans.append(count)
for i in range(len(ans)):
	print(ans[i])


t = int(input())
for a in range(0, t):
	m = list(map(int, str(input()).split(' ')))
	members = list(map(int, str(input()).split(' ')))
	members.sort(reverse=True)
	minLim = m[1]
	curAmount = 1
	ans = 0
	for i in range(0, len(members)):
		if curAmount * members[i] >= minLim:
			ans += 1
			curAmount = 0
		curAmount += 1
	print(ans)


from math import ceil as cl
for _ in range(int(input())):
	(n, x) = map(int, input().split())
	ar = list(map(int, input().split()))
	sums = [0 for i in range(n + 7)]
	for i in ar:
		if cl(x / i) <= n:
			sums[cl(x / i)] += 1
	prev = 0
	ans = 0
	for i in range(1, n + 1):
		z = prev + sums[i]
		if z >= i:
			ans += z // i
			prev = z % i
		else:
			prev += sums[i]
	print(ans)


t = int(input())
for q in range(t):
	s = input().split()
	n = int(s[0])
	x = int(s[1])
	s = input().split()
	for j in range(n):
		s[j] = int(s[j])
	s.sort(reverse=True)
	l = []
	for j in range(n):
		if x % s[j]:
			l.append(x // s[j] + 1)
		else:
			l.append(x // s[j])
	a = 0
	b = 0
	i = 0
	sum = 0
	while i < n:
		if l[i] <= b - a + 1:
			b += 1
			a = b
			sum += 1
		else:
			b += 1
		i += 1
	print(sum)


t = int(input())
for k in range(t):
	(n, x) = [int(x) for x in input().split()]
	a = [int(x) for x in input().split()]
	a = sorted(a, reverse=True)
	c = 0
	curC = 0
	curMin = a[0]
	for i in a:
		if i >= x:
			c += 1
		else:
			curC += 1
			curMin = i
			if curC * curMin >= x:
				c += 1
				curC = 0
				curMin = a[0]
	print(c)


for _ in range(int(input())):
	(n, x) = map(int, input().split())
	a = list(map(int, input().split()))
	a.sort()
	t = 0
	for i in range(n):
		if a[i] >= x:
			t = 1
			break
	if t == 1:
		b = a[i:]
		c = a[:i]
	else:
		b = []
		c = a
	y = len(c)
	if y == 0:
		print(len(b))
	else:
		min1 = 1
		if x % c[0] == 0:
			min1 = x // c[0]
		else:
			min1 = x // c[0] + 1
		(i, k) = (1, 1)
		teams = 0
		while i < y:
			if k == min1:
				teams += 1
				k = 1
				if x % c[i] == 0:
					min1 = x // c[i]
				else:
					min1 = x // c[i] + 1
			elif x % c[i] == 0:
				if x // c[i] <= min1 - k:
					min1 = x // c[i]
					k = 1
				else:
					k += 1
			elif x // c[i] + 1 <= min1 - k:
				min1 = x // c[i] + 1
				k = 1
			else:
				k += 1
			i += 1
		if k == min1:
			teams += 1
		print(teams + len(b))


for _ in range(int(input())):
	(n, x) = map(int, input().split())
	l = list(map(int, input().split()))
	l.sort()
	l.reverse()
	t = 0
	p = 0
	ctr = 0
	ctr1 = 0
	while ctr < n:
		ctr1 += 1
		p = ctr1 * l[ctr]
		if p >= x:
			t += 1
			ctr1 = 0
		ctr += 1
	print(t)


t = int(input())
for z in range(t):
	(n, x) = [int(i) for i in input().split()]
	a = [int(i) for i in input().split()]
	a.sort()
	a.reverse()
	team = 0
	j = 1
	for i in range(n):
		if a[i] * j >= x:
			team += 1
			j = 1
		else:
			j += 1
	print(team)


numberOfTc = int(input())
for ctr in range(1, numberOfTc + 1):
	(n, x) = map(int, input().split())
	lis = sorted(list(map(int, input().split())))[::-1]
	index = 1
	ans = 0
	for i in lis:
		if i * index >= x:
			ans += 1
			index = 0
		index += 1
	print(ans)


import sys
import math
import collections
import heapq
import queue
import itertools
import functools
import operator
import time
readline = sys.stdin.readline
IPS = lambda : readline().rstrip()
IP = lambda : int(readline().rstrip())
MP = lambda : map(int, readline().split())
LS = lambda : list(map(int, readline().split()))

def solve():
	for _ in range(IP()):
		(n, x) = MP()
		arr = LS()
		arr.sort(reverse=True)
		(prev, ans) = (-1, 0)
		for i in range(n):
			if arr[i] * (i - prev) >= x:
				ans += 1
				prev = i
		print(ans)
solve()


t = int(input())
for _ in range(t):
	(n, x) = map(int, input().split())
	A = list(map(int, input().split()))
	A.sort(reverse=True)
	temp = 0
	cnt = 0
	for a in A:
		if a * (temp + 1) >= x:
			cnt += 1
			temp = 0
		else:
			temp += 1
	print(cnt)


import math
for t in range(int(input())):
	(n, x) = map(int, input().split())
	a = sorted(list(map(int, input().split())))
	l = []
	for i in range(n):
		x1 = int(math.ceil(x / a[i]))
		if x1 + i - 1 < n:
			l.append([x1 + i - 1, i])
	l.sort(key=lambda p: (p[0], p[1]))
	end = -1
	cnt = 0
	for (et, st) in l:
		if et > end and st > end:
			cnt += 1
			end = et
	print(cnt)


from math import ceil
from itertools import groupby
for _ in range(int(input())):
	(n, x) = map(int, input().split())
	l = list(map(lambda i: ceil(x / int(i)), input().split()))
	l.sort()
	(cnt, rem, need) = (0, 0, 0)
	for (i, j) in groupby(l):
		leng = len(list(j))
		rem += leng % i
		cnt += leng // i + rem // i
		rem %= i
	print(cnt)


for _ in range(int(input())):
	(n, x) = map(int, input().split())
	a = list(map(int, input().split()))
	a.sort(reverse=True)
	ans = 0
	j = 1
	for i in range(n):
		if a[i] * j >= x:
			j = 1
			ans += 1
		else:
			j += 1
	print(ans)


def createTeam(s, x):
	s.sort()
	j = len(s) - 1
	num = 0
	while s:
		if s[-1] >= x:
			num += 1
			s.pop()
		else:
			break
	if len(s) > 1:
		put = 0
		while s:
			m = s.pop()
			put += 1
			if m * put >= x:
				num += 1
				put = 0
	return num
t = int(input())
for i in range(t):
	(n, x) = map(int, input().split())
	s = list(map(int, input().split()))
	print(createTeam(s, x))


for i in range(int(input())):
	(n, x) = map(int, input().split())
	arr = [int(i) for i in input().split()]
	arr.sort(reverse=True)
	count = 0
	sum = 0
	new = []
	for i in arr:
		if i >= x:
			count += 1
		else:
			new.append(i)
			if i * len(new) >= x:
				count += 1
				new = []
	print(count)


for _ in range(int(input())):
	(n, m) = map(int, input().split())
	(h, g) = (1, 0)
	ar = sorted(map(int, input().split()), reverse=True)
	for x in range(n):
		if ar[x] * h >= m:
			g += 1
			h = 1
		else:
			h += 1
	print(g)


for _ in range(int(input())):
	(n, x) = map(int, input().split())
	a = list(map(int, input().split()))
	a.sort()
	a = a[::-1]
	ans = 0
	count = 0
	mi = 999999999999
	for i in range(n):
		if count * mi >= x:
			ans += 1
			count = 1
			mi = a[i]
		else:
			count += 1
			mi = a[i]
	if count * mi >= x:
		ans += 1
	print(ans)


for _ in range(int(input())):
	(n, x) = map(int, input().split())
	a = list(map(int, input().split()))
	a.sort()
	i = n - 1
	count = 0
	while i >= 0 and a[i] >= x:
		count += 1
		i -= 1
	if i >= 0:
		j = i - 1
		while j >= 0:
			if a[j] * (i - j + 1) >= x:
				count += 1
				i = j - 1
			j -= 1
	print(count)


from math import ceil
for _ in range(int(input())):
	(n, x) = [int(_) for _ in input().split()]
	a = [int(_) for _ in input().split()]
	a = sorted(a, key=lambda x: -x)
	groups = 0
	min_members = [1000000000000000] + [int(ceil(x / i)) for i in range(1, n + 1)]
	min_members_count = [0 for _ in min_members]
	i = 0
	total = 0
	while i < len(min_members):
		j = 0
		while total < len(a) and a[total] >= min_members[i]:
			j += 1
			total += 1
		min_members_count[i] = j
		i += 1
	excess = 0
	i = 0
	for (i, c) in enumerate(min_members_count[1:]):
		i += 1
		total = excess + c
		groups += total // i
		excess = total % i
	print(groups)


for _ in range(int(input())):
	(n, k) = map(int, input().split())
	a = sorted(list(map(int, input().split())), reverse=True)
	ans = 0
	len = 1
	for i in range(n):
		if a[i] * len >= k:
			ans += 1
			len = 0
		len += 1
	print(ans)


for _ in range(int(input())):
	(n, x) = map(int, input().split())
	lst = sorted(list(map(int, input().split())), reverse=True)
	mini = lst[0]
	count = 0
	l = 1
	for i in range(1, n):
		if mini * l >= x:
			count += 1
			mini = lst[i]
			l = 1
		else:
			mini = min(mini, lst[i])
			l += 1
	if mini * l >= x:
		count += 1
	print(count)


def solve(n, x, ar):
	ar = sorted(ar, reverse=True)
	res = 0
	cur = 1
	for i in ar:
		if i * cur >= x:
			res += 1
			cur = 0
		cur += 1
	print(res)
t = int(input())
for _ in range(t):
	(n, x) = map(int, input().split())
	ar = list(map(int, input().split()))
	solve(n, x, ar)


import math
cases = int(input())
for t in range(cases):
	(n, x) = list(map(int, input().split()))
	a = list(map(int, input().split()))
	a = sorted(a)[::-1]
	minelem = a[-1]
	d = {i: math.ceil(x / i) for i in range(1, n + 1)}
	c = 1
	c1 = 0
	s = 0
	for i in a:
		if i >= d[c]:
			c1 += 1
		else:
			if c1 >= c:
				s += c1 // c
				c1 = c1 % c
			c1 += 1
			c += 1
	if c1 >= c:
		s += c1 // c
	print(s)


import sys
input = sys.stdin.readline
output = lambda x: sys.stdout.write(x + '\n')
for _ in range(int(input())):
	(n, x) = map(int, input().split())
	a = list(map(int, input().split()))
	a.sort(reverse=True)
	res = 0
	cur = 0
	for val in a:
		if val * (cur + 1) >= x:
			cur = 0
			res += 1
		else:
			cur += 1
	output(str(res))


for _ in range(int(input())):
	(n, x) = map(int, input().split())
	a = sorted(list(map(int, input().split())))
	a.sort(reverse=True)
	i = 0
	ans = 0
	c = 0
	while i < len(a):
		c += 1
		p = c * a[i]
		if p >= x:
			ans += 1
			c = 0
		i += 1
	print(ans)


import sys
input = sys.stdin.readline
for _ in range(int(input())):
	(n, x) = map(int, input().split())
	A = sorted(map(int, input().split()), reverse=True)
	c = 0
	r = 0
	for v in A:
		c += 1
		if c * v >= x:
			r += 1
			c = 0
	print(r)


import sys
input = sys.stdin.readline
for _ in range(int(input())):
	(n, x) = map(int, input().split())
	a = sorted(list(map(int, input().split())), reverse=True)
	ans = 0
	k = 1
	for i in range(n):
		if a[i] * k >= x:
			ans += 1
			k = 1
		else:
			k += 1
	print(ans)


t = int(input())
for _ in range(t):
	(n, x) = map(int, input().split())
	a = list(map(lambda y: (x - 1) // int(y) + 1, input().split()))
	a.sort()
	cnt = 0
	ans = 0
	for k in a:
		cnt += 1
		if k <= cnt:
			cnt = 0
			ans += 1
	print(ans)


for _ in range(int(input())):
	(n, x) = list(map(int, input().split()))
	a = list(map(int, input().split()))
	a.sort()
	ans = 0
	last = n
	for i in range(n - 1, -1, -1):
		if x % a[i] == 0:
			b = x // a[i]
		else:
			b = x // a[i] + 1
		if last - i >= b:
			ans += 1
			last -= b
	print(ans)


t = int(input())
while t > 0:
	t -= 1
	(n, x) = map(int, input().split())
	a = list(map(int, input().split()))
	a.sort(reverse=True)
	k = 1
	team = 0
	for i in range(len(a)):
		if a[i] * k < x:
			k += 1
		else:
			team += 1
			k = 1
	print(team)


testCases = int(input())
while testCases:
	testCases -= 1
	x = input()
	y = input()
	x = list(map(int, x.split()))
	y = list(map(int, y.split()))
	y.sort()
	y = y[::-1]
	i = 0
	step = 1
	teams = 0
	while i < len(y):
		if y[i] * step >= x[1]:
			teams += 1
			step = 1
		else:
			step += 1
		i += 1
	print(teams)


def mi():
	return map(int, input().split())

def ii():
	return int(input())

def li():
	return list(map(int, input().split()))

def si():
	return input().split()
t = ii()
for _ in range(t):
	(n, x) = mi()
	a = li()
	a.sort(reverse=True)
	ans = 0
	ind = -1
	for i in range(n):
		if a[i] * (i - ind) >= x:
			ans += 1
			ind = i
	print(ans)


for _ in range(int(input())):
	(n, x) = map(int, input().split())
	a = sorted(map(int, input().split()))[::-1]
	s = 0
	c = 0
	for i in range(n):
		c += 1
		if c * a[i] >= x:
			s += 1
			c = 0
	print(s)


var_t = lambda : map(int, input().split())
(V,) = var_t()
while V:
	(an, ax) = var_t()
	var_y = sorted(var_t())
	iy = 0
	while var_y:
		var_x = 1
		while var_y and var_x * var_y[-1] < ax:
			var_x += 1
			var_y.pop()
		if var_y:
			iy += 1
			var_y.pop()
	print(iy)
	V -= 1


from sys import *
input = stdin.readline
T = int(input())
for case in range(T):
	(n, x) = map(int, input().split())
	Skills = [*map(int, input().split())]
	Skills.sort(reverse=True)
	cnt = 0
	Ans = 0
	for i in range(n):
		cnt += 1
		if cnt * Skills[i] >= x:
			Ans += 1
			cnt = 0
	print(Ans)


for i in range(int(input())):
	(n, x) = [int(i) for i in input().split()]
	arr = [int(i) for i in input().split()]
	arr.sort(reverse=True)
	ans = 0
	n = 0
	for i in arr:
		if i >= x:
			ans += 1
		else:
			n += 1
			if i * n >= x:
				ans += 1
				n = 0
	print(ans)


def f(i):
	i = int(i)
	return x // i + (x % i != 0)
for w in range(int(input())):
	(n, x) = map(int, input().strip().split())
	brr = list(map(f, input().strip().split()))
	brr.sort()
	(value, c) = (0, 0)
	for i in range(n):
		c += 1
		if brr[i] <= c:
			value += 1
			c -= brr[i]
	print(value)


import sys
input = sys.stdin.readline
t = int(input())
for _ in range(t):
	(n, x) = list(map(int, input().split()))
	a = list(map(int, input().split()))
	a.sort(reverse=True)
	i = 0
	b = 1
	d = 0
	while i < n:
		if b * a[i] >= x:
			b = 1
			i += 1
			d += 1
		else:
			i += 1
			b += 1
	print(d)


T = int(input())
for t in range(T):
	line = input().split(' ')
	(n, x) = (int(line[0]), int(line[1]))
	a = (int(val) for val in input().split(' '))
	a = sorted(a)
	teams = 0
	cand_min = 0
	cand_num = 0
	while len(a) > 0:
		cand_min = a.pop()
		cand_num += 1
		if cand_min * cand_num >= x:
			teams += 1
			cand_num = 0
	print(teams)


tc = int(input())
for _ in range(tc):
	(n, x) = (int(x) for x in input().split())
	arr = sorted([int(x) for x in input().split()], reverse=True)
	groups = 0
	group_size = 1
	while arr:
		v = arr.pop(0)
		if v >= x:
			groups += 1
		elif v * group_size >= x:
			groups += 1
			group_size = 1
		else:
			group_size += 1
	print(groups)


import math
t = int(input())
for _ in range(t):
	(n, x) = [int(i) for i in input().split()]
	arr = [int(i) for i in input().split()]
	arr.sort(reverse=True)
	start = end = count = 0
	while start < n:
		mi = arr[start]
		no_ele = start - end + 1
		temp = mi * no_ele
		start += 1
		if temp >= x:
			count += 1
			end = start
	print(count)


for _ in range(int(input())):
	(n, m) = map(int, input().split())
	a = sorted(map(int, input().split()))
	b = [0] * (n + 1)
	for i in range(n - 1, -1, -1):
		b[i] = b[i + 1]
		x = (m + a[i] - 1) // a[i]
		if i + x <= n:
			b[i] = max(b[i], 1 + b[i + x])
	print(b[0])


from sys import *
input = stdin.readline
t = int(input())
for _ in range(t):
	(n, k) = map(int, input().split())
	p = list(map(int, input().split()))
	l = []
	for i in p:
		x = k // i
		if k % i != 0:
			x += 1
		l.append(x)
	l.sort()
	c = 0
	i = 0
	left = 0
	while i < n:
		j = i + l[i] - 1
		if j < n and l[j] == l[i]:
			c += 1
			i = j + 1
		elif left >= l[i] - 1:
			c += 1
			left -= l[i] - 1
			i += 1
		else:
			left += 1
			i += 1
	print(c)


for _ in range(int(input())):
	(n, x) = list(map(int, input().split()))
	mass = list(map(int, input().split()))
	mass = sorted(mass, reverse=True)
	buff = []
	ans = 0
	for item in mass:
		buff.append(item)
		if len(buff) * item >= x:
			buff = []
			ans += 1
	print(ans)


T = int(input())
for _ in range(T):
	(n, x) = map(int, input().split())
	arr = list(map(int, input().split()))
	arr = sorted(arr)
	cnt = 1
	ans = 0
	for i in range(n - 1, -1, -1):
		if arr[i] * cnt >= x:
			ans += 1
			cnt = 1
		else:
			cnt += 1
	print(ans)


for _ in range(int(input())):
	(n, x) = map(int, input().split())
	a = sorted(map(int, input().split()), reverse=True)
	cnt = 0
	i = 1
	for item in a:
		if item * i >= x:
			cnt += 1
			i = 0
		i += 1
	print(cnt)


def problemA():
	n = int(input())
	l = list(map(int, input().split()))
	i = 0
	while i < n - 1 and l[i] > l[i + 1]:
		i += 1
	if i == n - 1:
		print('NO')
		return
	j = i + 1
	while j < n - 1 and l[j] < l[j + 1]:
		j += 1
	if j == n - 1:
		print('NO')
		return
	print('YES')
	print(i + 1, j + 1, j + 2)

def problemB():
	s = input().strip()
	a = [0] * 3
	for i in s:
		if i == 'R':
			a[0] += 1
		elif i == 'S':
			a[1] += 1
		else:
			a[2] += 1
	m = max(a)
	if a[0] == m:
		print('P' * sum(a))
	elif a[1] == m:
		print('R' * sum(a))
	else:
		print('S' * sum(a))

def problemC():
	(a, b) = list(map(int, input().split()))
	l = list(map(int, input().split()))
	l.sort(reverse=True)
	n = 0
	t = 0
	for i in range(a):
		n += 1
		if l[i] * n >= b:
			t += 1
			n = 0
	print(t)
cases = int(input())
for _ in range(cases):
	problemC()


for _ in range(int(input())):
	(n, x) = map(int, input().split())
	l = list(map(int, input().split()))
	l.sort()
	i = len(l) - 1
	res = 0
	j = 1
	while i >= 0:
		if j * l[i] >= x:
			res += 1
			i -= 1
			j = 1
		else:
			i -= 1
			j += 1
	print(res)


import math

def func(n, x, arr):
	new_list = arr.copy()
	num_teams = 0
	while len(arr) != 0:
		to_remove = math.ceil(x / arr[0])
		if to_remove > n:
			break
		num_teams += 1
		del arr[0:to_remove]
	if len(new_list) == 1:
		return num_teams
	else:
		del new_list[0]
		return max(num_teams, func(n - 1, x, new_list))

def greedy(n, x, arr):
	current_small = arr[0]
	current_size = 0
	num_teams = 0
	for i in range(0, n):
		current_small = arr[i]
		current_size += 1
		if current_small * current_size >= x:
			num_teams += 1
			current_size = 0
	return num_teams
t = int(input())
ns = []
xs = []
arrs = []
for _ in range(t):
	(cn, cx) = input().split(' ')
	ns.append(int(cn))
	xs.append(int(cx))
	carr = input().split(' ')
	carr = [int(x) for x in carr]
	carr = sorted(carr)
	carr = carr[::-1]
	arrs.append(carr)
for j in range(t):
	n = ns[j]
	x = xs[j]
	arr = arrs[j]
	print(greedy(n, x, arr))


t = int(input())
for _ in range(t):
	(n, restriction) = list(map(int, input().split(' ')))
	li = list(map(int, input().split(' ')))
	li.sort(reverse=True)
	count = 0
	i = 1
	for x in li:
		if x * i >= restriction:
			count += 1
			i = 1
		else:
			i += 1
	print(count)


t = int(input())
for _ in range(t):
	(n, x) = list(map(int, input().split()))
	l = list(map(int, input().split()))
	l.sort()
	dp = [0] * n
	for i in range(n - 1, -1, -1):
		if i == n - 1:
			if l[i] >= x:
				dp[i] = 1
			else:
				dp[i] = 0
		else:
			f = x // l[i] + bool(x % l[i])
			if i + f - 1 < n:
				dp[i] = 1
			else:
				dp[i] = 0
			if i + f < n:
				dp[i] = dp[i] + dp[i + f]
	print(max(dp))


for _ in range(int(input())):
	(n, x) = map(int, input().split())
	a = list(map(int, input().split()))
	a = sorted(a)
	mul = 0
	ct = 0
	for i in range(n):
		mul += 1
		if a[-i - 1] * mul >= x:
			ct += 1
			mul = 0
	print(ct)


def solve(n, x, arr):
	arr = sorted(arr)
	res = 0
	temp_length_so_far = 0
	for i in range(n - 1, -1, -1):
		temp_length_so_far += 1
		if arr[i] * temp_length_so_far >= x:
			res += 1
			temp_length_so_far = 0
	return res
T = int(input())
for _ in range(T):
	(n, x) = map(int, input().split())
	arr = map(int, input().split())
	print(solve(n, x, arr))


t = int(input())
while t:
	(n, k) = map(int, input().split())
	a = list(map(int, input().split()))
	a.sort(reverse=True)
	cur = 0
	ind = 1
	for i in a:
		if i * ind >= k:
			ind = 0
			cur += 1
		ind += 1
	print(cur)
	t = t - 1


T = int(input())
while T:
	(n, x) = list(map(int, input().split()))
	prog = list(map(int, input().split()))
	prog.sort()
	r = len(prog) - 1
	result = 0
	size = 1
	while r >= 0:
		if prog[r] * size >= x:
			r -= 1
			size = 1
			result += 1
		else:
			r -= 1
			size += 1
	print(result)
	T -= 1


for _ in range(int(input())):
	(n, x) = map(int, input().split())
	l = list(map(int, input().split()))
	l.sort(reverse=True)
	s = 0
	cur = 1
	for i in range(n):
		if l[i] * cur >= x:
			s += 1
			cur = 1
		else:
			cur += 1
	print(s)


t = int(input())
ng_tot = []
import math
for k in range(t):
	(n, x) = map(str, input().split())
	n = int(n)
	x = int(x)
	vec = input().split()
	ng = 0
	rem = []
	for i in range(n):
		vec[i] = int(vec[i])
		if vec[i] >= x:
			ng += 1
		else:
			rem.append(vec[i])
	rem = sorted(rem)
	i = len(rem) - 1
	kk = 1
	while i >= 0 and i >= kk:
		if rem[i - kk] * (kk + 1) >= x:
			ng += 1
			i = i - kk - 1
			kk = 1
		else:
			kk += 1
	ng_tot.append(ng)
for i in range(t):
	print(ng_tot[i])


import sys, bisect, string, math, time, functools, random, fractions
from heapq import heappush, heappop, heapify
from collections import deque, defaultdict, Counter
from itertools import permutations, combinations, groupby
rep = range

def Golf():
	(n, *t) = map(int, open(0).read().split())

def I():
	return int(input())

def S_():
	return input()

def IS():
	return input().split()

def LS():
	return [i for i in input().split()]

def MI():
	return map(int, input().split())

def LI():
	return [int(i) for i in input().split()]

def LI_():
	return [int(i) - 1 for i in input().split()]

def NI(n):
	return [int(input()) for i in range(n)]

def NI_(n):
	return [int(input()) - 1 for i in range(n)]

def StoLI():
	return [ord(i) - 97 for i in input()]

def ItoS(n):
	return chr(n + 97)

def LtoS(ls):
	return ''.join([chr(i + 97) for i in ls])

def RA():
	return map(int, open(0).read().split())

def GI(V, E, ls=None, Directed=False, index=1):
	org_inp = []
	g = [[] for i in R(V)]
	FromStdin = True if ls == None else False
	for i in R(E):
		if FromStdin:
			inp = LI()
			org_inp.append(inp)
		else:
			inp = ls[i]
		if len(inp) == 2:
			(a, b) = inp
			c = 1
		else:
			(a, b, c) = inp
		if index == 1:
			a -= 1
			b -= 1
		aa = (a, c)
		bb = (b, c)
		g[a].append(bb)
		if not Directed:
			g[b].append(aa)
	return (g, org_inp)

def GGI(h, w, search=None, replacement_of_found='.', mp_def={'#': 1, '.': 0}, boundary=1):
	mp = [boundary] * (w + 2)
	found = {}
	for i in R(h):
		s = input()
		for char in search:
			if char in s:
				found[char] = (i + 1) * (w + 2) + s.index(char) + 1
				mp_def[char] = mp_def[replacement_of_found]
		mp += [boundary] + [mp_def[j] for j in s] + [boundary]
	mp += [boundary] * (w + 2)
	return (h + 2, w + 2, mp, found)

def TI(n):
	return GI(n, n - 1)

def accum(ls):
	rt = [0]
	for i in ls:
		rt += [rt[-1] + i]
	return rt

def bit_combination(n, base=2):
	rt = []
	for tb in R(base ** n):
		s = [tb // base ** bt % base for bt in R(n)]
		rt += [s]
	return rt

def gcd(x, y):
	if y == 0:
		return x
	if x % y == 0:
		return y
	while x % y != 0:
		(x, y) = (y, x % y)
	return y

def YN(x):
	print(['NO', 'YES'][x])

def Yn(x):
	print(['No', 'Yes'][x])

def show(*inp, end='\n'):
	if show_flg:
		print(*inp, end=end)
mo = 10 ** 9 + 7
inf = float('inf')
FourNb = [(-1, 0), (1, 0), (0, 1), (0, -1)]
EightNb = [(-1, 0), (1, 0), (0, 1), (0, -1), (1, 1), (-1, -1), (1, -1), (-1, 1)]
compas = dict(zip('WENS', FourNb))
cursol = dict(zip('LRUD', FourNb))
l_alp = string.ascii_lowercase
read = sys.stdin.buffer.read
readline = sys.stdin.buffer.readline
input = lambda : sys.stdin.readline().rstrip()
show_flg = False
show_flg = True
for _ in range(I()):
	ans = 0
	(n, x) = LI()
	a = LI()
	a.sort()
	while a:
		t = 1
		p = a.pop()
		if p >= x:
			ans += 1
			continue
		else:
			while a:
				t += 1
				c = a.pop()
				if c * t >= x:
					ans += 1
					break
	print(ans)


def solve():
	(n, x) = [int(x) for x in input().split()]
	skills = sorted([int(x) for x in input().split()], reverse=True)
	size = 0
	ans = 0
	for e in skills:
		if e * (size + 1) >= x:
			ans += 1
			size = 0
		else:
			size += 1
	return ans
T = int(input())
for case in range(T):
	print(solve())


t = int(input())
for hatt in range(t):
	(n, x) = [int(num) for num in input().split()]
	a = [int(num) for num in input().split()]
	a.sort()
	prevcoun = 0
	team = 0
	for i in range(n - 1, -1, -1):
		minnum = (x - 1) // a[i] + 1
		if prevcoun + 1 >= minnum:
			prevcoun = prevcoun + 1 - minnum
			team += 1
		else:
			prevcoun += 1
	print(team)


from bisect import *
import math
from collections import *
from heapq import *
from itertools import *
inf = 10 ** 18
mod = 10 ** 9 + 7
for _ in range(int(input())):
	(n, x) = map(int, input().split())
	a = list(map(int, input().split()))
	a.sort(reverse=True)
	team = 0
	cur = 0
	for i in range(n):
		cur += 1
		if cur * a[i] >= x:
			team += 1
			pro = 1
			cur = 0
	print(team)


import math
from collections import defaultdict
a = []
b = []
t = int(input())
for i in range(t):
	(c, x) = map(int, input().split())
	a.append(x)
	b.append(list(map(int, input().split())))
for i in range(t):
	x = a[i]
	ar = b[i]
	ar.sort(reverse=True)
	ans = 0
	slen = 0
	for j in range(len(ar)):
		slen += 1
		if ar[j] * slen >= x:
			ans += 1
			slen = 0
	print(ans)


import math
from collections import *
import sys
from functools import reduce

def get_ints():
	return map(int, input().strip().split())

def get_list():
	return list(get_ints())

def get_string():
	return list(input().strip().split())

def printxsp(*args):
	return print(*args, end='')

def printsp(*args):
	return print(*args, end=' ')
DIRECTIONS = [[0, 1], [0, -1], [1, 0], [1, -1]]
NEIGHBOURS = [(i, j) for i in range(-1, 2) for j in range(-1, 2) if i != 0 or j != 0]
OrdUnicode_a = ord('a')
OrdUnicode_A = ord('A')
CAPS_ALPHABETS = {chr(i + OrdUnicode_A): i for i in range(26)}
SMOL_ALPHABETS = {chr(i + OrdUnicode_a): i for i in range(26)}
MOD_JOHAN = int(1000000000.0) + 7
MOD_LIGHT = 998244353
INFINITY = float('inf')
MAXN_EYEPATCH = int(100000.0) + 1
MAXN_FULLMETAL = 501
for _testcases_ in range(int(input())):
	(n, k) = get_ints()
	li = get_list()
	li = sorted(li, reverse=True)
	teams = 0
	i = 0
	while i < len(li):
		thissize = 1
		minteam = li[i]
		while thissize * minteam < k and i + 1 < len(li):
			i += 1
			minteam = min(minteam, li[i])
			thissize += 1
		if thissize * minteam >= k:
			teams += 1
		i += 1
	print(teams)


from math import ceil
t = int(input())
for _ in range(t):
	(n, x) = map(int, input().split())
	ma = map(int, input().split())
	lt = list(ma)
	lt = sorted(lt, reverse=True)
	teams = 0
	com = 1
	deb = 0
	for i in range(n):
		if lt[i] * com >= x:
			teams += 1
			com = 1
		else:
			com += 1
	print(teams)


from collections import defaultdict
import math
t = int(input())
for z in range(t):
	(n, b) = list(map(int, input().split()))
	a = list(map(int, input().split()))
	a.sort(reverse=True)
	c = 0
	i = 0
	while a[i] >= b:
		c += 1
		i += 1
		if i == n:
			break
	d = 0
	while i < n:
		d += 1
		if b <= d * a[i]:
			c += 1
			d = 0
		i += 1
	print(c)


from sys import stdin, stdout

def INPUT():
	return list((int(i) for i in stdin.readline().split()))

def inp():
	return stdin.readline()

def out(x):
	return stdout.write(x)
import math
import bisect as B
for _ in range(int(input())):
	(n, x) = INPUT()
	A = INPUT()
	A.sort()
	ans = 0
	i = n - 1
	while i >= 0 and A[i] >= x:
		ans += 1
		i -= 1
	while i >= 0:
		count = 1
		while i >= 0 and A[i] * count < x:
			count += 1
			i -= 1
		if i >= 0 and A[i] * count >= x:
			ans += 1
		i -= 1
	print(ans)


for i in range(int(input())):
	(n, k) = map(int, input().split())
	a = sorted(list(map(int, input().split())))
	a.reverse()
	f = 1
	c = 0
	for i in range(n):
		if a[i] * f >= k:
			c = c + 1
			f = 1
		else:
			f = f + 1
	print(c)


import bisect
t = int(input())
while t:
	t -= 1
	(n, k) = map(int, input().split())
	a = [int(x) for x in input().split()]
	a.sort()
	res = bisect.bisect_left(a, k)
	ans = n - res
	i = res - 1
	c = 1
	while i >= 0:
		temp = a[i] * c
		if temp >= k:
			ans += 1
			c = 0
		i -= 1
		c += 1
	print(ans)


for _ in range(int(input())):
	(a, b) = map(int, input().split())
	z = sorted(map(int, input().split()))
	(ans, n) = (0, 0)
	while z:
		q = z.pop()
		n += 1
		if n * q >= b:
			ans += 1
			n = 0
	print(ans)


from sys import stdin, stdout
import sys
INF = 100000000000.0
import bisect

def get_int():
	return int(stdin.readline().strip())

def get_ints():
	return map(int, stdin.readline().strip().split())

def get_array():
	return list(map(int, stdin.readline().strip().split()))

def get_string():
	return stdin.readline().strip()

def op(c):
	return stdout.write(c)
from collections import defaultdict
import math
for t in range(int(stdin.readline())):
	(n, x) = get_ints()
	arr = get_array()
	arr.sort(reverse=True)
	m1 = arr[0]
	ans = 0
	c = 0
	for i in range(0, n):
		c += 1
		m1 = arr[i]
		if c * m1 >= x:
			ans += 1
			c = 0
	print(ans)


t = input()
T = int(t)
id = 0
while id < T:
	s = input()
	sd = s.split(' ')
	a = input()
	arr = a.split(' ')
	n = int(sd[0])
	k = int(sd[1])
	ls = list()
	for b in arr:
		ls.append(int(b))
	ls.sort()
	ls.reverse()
	cnt = 1
	ans = 0
	for b in ls:
		if cnt * b >= k:
			ans = ans + 1
			cnt = 1
		else:
			cnt = cnt + 1
	print(ans)
	id = id + 1


from math import ceil

def main():
	t = int(input())
	for i in range(t):
		(n, x) = map(int, input().split())
		values = list(map(int, input().split()))
		right = n
		count = 0
		values.sort()
		for i in range(n - 1, -1, -1):
			if values[i] * (right - i) >= x:
				count += 1
				right = i
		print(count)
main()


import sys, os, io

def rs():
	return sys.stdin.readline().rstrip()

def ri():
	return int(sys.stdin.readline())

def ria():
	return list(map(int, sys.stdin.readline().split()))

def ws(s):
	sys.stdout.write(s + '\n')

def wi(n):
	sys.stdout.write(str(n) + '\n')

def wia(a):
	sys.stdout.write(' '.join([str(x) for x in a]) + '\n')
import math, datetime, functools, itertools
from collections import deque, defaultdict, OrderedDict
import collections

def main():
	starttime = datetime.datetime.now()
	if os.path.exists('input.txt'):
		sys.stdin = open('input.txt', 'r')
		sys.stdout = open('output.txt', 'w')
	for _ in range(ri()):
		(n, x) = ria()
		a = ria()
		a = deque(sorted(a)[::-1])
		t = 0
		while True:
			if len(a) >= 1 and a[0] >= x:
				t += 1
				a.popleft()
				if len(a) == 0:
					break
			else:
				s = 1
				c = 0
				while len(a) > 0:
					c += 1
					s = a[0] * c
					a.popleft()
					if s >= x:
						t += 1
						break
				if len(a) == 0:
					break
		print(t)
	endtime = datetime.datetime.now()
	time = (endtime - starttime).total_seconds() * 1000
	if os.path.exists('input.txt'):
		print('Time:', time, 'ms')

class FastReader(io.IOBase):
	newlines = 0

	def __init__(self, fd, chunk_size=1024 * 8):
		self._fd = fd
		self._chunk_size = chunk_size
		self.buffer = io.BytesIO()

	def read(self):
		while True:
			b = os.read(self._fd, max(os.fstat(self._fd).st_size, self._chunk_size))
			if not b:
				break
			ptr = self.buffer.tell()
			(self.buffer.seek(0, 2), self.buffer.write(b), self.buffer.seek(ptr))
		self.newlines = 0
		return self.buffer.read()

	def readline(self, size=-1):
		while self.newlines == 0:
			b = os.read(self._fd, max(os.fstat(self._fd).st_size, self._chunk_size if size == -1 else size))
			self.newlines = b.count(b'\n') + (not b)
			ptr = self.buffer.tell()
			(self.buffer.seek(0, 2), self.buffer.write(b), self.buffer.seek(ptr))
		self.newlines -= 1
		return self.buffer.readline()

class FastWriter(io.IOBase):

	def __init__(self, fd):
		self._fd = fd
		self.buffer = io.BytesIO()
		self.write = self.buffer.write

	def flush(self):
		os.write(self._fd, self.buffer.getvalue())
		(self.buffer.truncate(0), self.buffer.seek(0))

class FastStdin(io.IOBase):

	def __init__(self, fd=0):
		self.buffer = FastReader(fd)
		self.read = lambda : self.buffer.read().decode('ascii')
		self.readline = lambda : self.buffer.readline().decode('ascii')

class FastStdout(io.IOBase):

	def __init__(self, fd=1):
		self.buffer = FastWriter(fd)
		self.write = lambda s: self.buffer.write(s.encode('ascii'))
		self.flush = self.buffer.flush
sys.stdin = FastStdin()
sys.stdout = FastStdout()
main()


import math

def find_max_team(arr, x):
	sec_array = []
	arr = sorted(arr, reverse=True)
	for el in arr:
		sec_array.append(math.ceil(x / el))
	stock = 0
	count = 0
	for el in sec_array:
		if stock + 1 == el:
			count += 1
			stock = 0
		else:
			stock += 1
	return count
t = int(input())
for _ in range(t):
	(n, x) = map(int, input().split())
	arr = list(map(int, input().split()))
	count = find_max_team(arr, x)
	print(count)


import math
t = int(input())
for x in range(t):
	(n, x) = map(int, input().split(' '))
	a = list(map(int, input().split(' ')))
	a.sort()
	a.reverse()
	rest = 0
	count = 0
	start = math.ceil(x / a[0])
	group = 0
	for j in a:
		if math.ceil(x / j) == start:
			group += 1
		else:
			c = (rest + group) // start
			count += c
			rest = rest + group - c * start
			start = math.ceil(x / j)
			group = 1
	c = (rest + group) // start
	count += c
	print(count)


t = int(input())
for _ in range(t):
	(n, mm) = map(int, input().split())
	a = [int(y) for y in input().split()]
	a = sorted(a, reverse=True)
	h = 0
	m = a[0]
	l = 0
	for i in a:
		if m * h >= mm:
			l += 1
			h = 1
			m = i
		else:
			m = min(m, i)
			h += 1
	if m * h >= mm:
		l += 1
	print(l)


t = int(input())
for _ in range(t):
	(n, k) = map(int, input().split())
	a = list(map(int, input().split()))
	a.sort()
	a.reverse()
	ans = 0
	cc = 1
	for i in range(0, n):
		if a[i] * cc >= k:
			ans += 1
			cc = 1
		else:
			cc += 1
	print(ans)


for _ in range(int(input())):
	(n, x) = [int(i) for i in input().split()]
	lst = [int(i) for i in input().split()][:n]
	lst.sort()
	(k, tmp) = (0, 1)
	for i in range(n - 1, -1, -1):
		if lst[i] * tmp >= x:
			k += 1
			tmp = 1
		else:
			tmp += 1
	print(k)


import sys
from functools import lru_cache, cmp_to_key
from heapq import merge, heapify, heappop, heappush, nsmallest
from math import ceil, floor, gcd, fabs, factorial, fmod, sqrt, inf
from collections import defaultdict as dd, deque, Counter as C
from itertools import combinations as comb, permutations as perm
from bisect import bisect_left as bl, bisect_right as br, bisect
from time import perf_counter
from fractions import Fraction
from decimal import Decimal
mod = pow(10, 9) + 7
mod2 = 998244353

def data():
	return sys.stdin.readline().strip()

def out(var):
	sys.stdout.write(str(var) + '\n')

def outa(*var, end='\n'):
	sys.stdout.write(' '.join(map(str, var)) + end)

def l():
	return list(sp())

def sl():
	return list(ssp())

def sp():
	return map(int, data().split())

def ssp():
	return map(str, data().split())

def l1d(n, val=0):
	return [val for i in range(n)]

def l2d(n, m, val=0):
	return [l1d(n, val) for j in range(m)]
for _ in range(int(data())):
	(n, x) = sp()
	arr = l()
	arr.sort(reverse=True)
	answer = 0
	(cnt, m) = (0, inf)
	for i in range(n):
		if cnt * m >= x:
			answer += 1
			cnt = 1
			m = arr[i]
			continue
		cnt += 1
		m = min(m, arr[i])
	if cnt * m >= x:
		answer += 1
	out(answer)


for _ in range(int(input())):
	(n, x) = map(int, input().split())
	a = list(map(int, input().split()))
	a.sort()
	i = 1
	q = 1
	ans = 0
	while i <= n:
		if a[-i] * q >= x:
			ans += 1
			q = 1
		else:
			q += 1
		i += 1
	print(ans)


t = int(input())
for i in range(t):
	(n, x) = [int(s) for s in input().split()]
	array = [int(s) for s in input().split()]
	array = sorted(array)
	new = []
	ans = 0
	for j in range(len(array)):
		if array[j] < x:
			new.append(array[j])
		else:
			ans += 1
	j = 0
	tmp = 0
	tmp_ans = 0
	new = new[::-1]
	while j < len(new):
		tmp += 1
		tmp_ans = new[j] * tmp
		if tmp_ans >= x:
			tmp = 0
			tmp_ans = 0
			ans += 1
		j += 1
	print(ans)


t = int(input())
for i in range(t):
	(n, x) = map(int, input().split())
	l = []
	l = [int(num) for num in input().split()]
	l.sort(reverse=True)
	(m, g) = (1, 0)
	for k in range(n):
		if l[k] * m >= x:
			g = g + 1
			m = 1
		else:
			m = m + 1
	print(g)


from sys import stdin, stdout
int_in = lambda : int(stdin.readline())
arr_in = lambda : [int(x) for x in stdin.readline().split()]
mat_in = lambda rows: [arr_in() for _ in range(rows)]
str_in = lambda : stdin.readline().strip()
out = lambda o: stdout.write('{}\n'.format(o))
arr_out = lambda o: out(' '.join(map(str, o)))
bool_out = lambda o: out('YES' if o else 'NO')
tests = lambda : range(1, int_in() + 1)
case_out = lambda i, o: out('Case #{}: {}'.format(i, o))
from bisect import bisect_left

def solve(n, x, a):
	a.sort(reverse=True)
	result = 0
	curr = 1
	for item in a:
		if curr * item >= x:
			result += 1
			curr = 1
		else:
			curr += 1
	return result
for _ in tests():
	(n, x) = arr_in()
	a = arr_in()
	out(solve(n, x, a))


import sys

def input():
	return sys.stdin.readline().strip()

def list2d(a, b, c):
	return [[c] * b for i in range(a)]

def list3d(a, b, c, d):
	return [[[d] * c for j in range(b)] for i in range(a)]

def list4d(a, b, c, d, e):
	return [[[[e] * d for j in range(c)] for j in range(b)] for i in range(a)]

def ceil(x, y=1):
	return int(-(-x // y))

def INT():
	return int(input())

def MAP():
	return map(int, input().split())

def LIST(N=None):
	return list(MAP()) if N is None else [INT() for i in range(N)]

def Yes():
	print('Yes')

def No():
	print('No')

def YES():
	print('YES')

def NO():
	print('NO')
INF = 10 ** 19
MOD = 10 ** 9 + 7
for _ in range(INT()):
	(N, K) = MAP()
	A = LIST()
	A.sort(reverse=1)
	ans = 0
	cnt = 1
	for a in A:
		if a * cnt >= K:
			ans += 1
			cnt = 1
		else:
			cnt += 1
	print(ans)


import os, io
from sys import stdout
import collections
input = io.BytesIO(os.read(0, os.fstat(0).st_size)).readline
import sys

def primes(n):
	sieve = [True] * n
	for i in range(3, int(n ** 0.5) + 1, 2):
		if sieve[i]:
			sieve[i * i::2 * i] = [False] * ((n - i * i - 1) // (2 * i) + 1)
	return [2] + [i for i in range(3, n, 2) if sieve[i]]

def binomial_coefficient(n, k):
	if 0 <= k <= n:
		ntok = 1
		ktok = 1
		for t in range(1, min(k, n - k) + 1):
			ntok *= n
			ktok *= t
			n -= 1
		return ntok // ktok
	else:
		return 0

def powerOfK(k, max):
	if k == 1:
		return [1]
	if k == -1:
		return [-1, 1]
	result = []
	n = 1
	while n <= max:
		result.append(n)
		n *= k
	return result

def divisors(n):
	i = 1
	result = []
	while i * i <= n:
		if n % i == 0:
			if n / i == i:
				result.append(i)
			else:
				result.append(i)
				result.append(n / i)
		i += 1
	return result

def distance(xa, ya, xb, yb):
	return ((ya - yb) ** 2 + (xa - xb) ** 2) ** 0.5

def digitsSum(n):
	if n == 0:
		return 0
	r = 0
	while n > 0:
		r += n % 10
		n //= 10
	return r

def isValid(i, j, n, m):
	return i >= 0 and i < n and (j >= 0) and (j < m)

def print_grid(grid):
	for line in grid:
		print(' '.join(map(str, line)))

def kadane(a, size):
	max_so_far = 0
	max_ending_here = 0
	for i in range(0, size):
		max_ending_here = max_ending_here + a[i]
		if max_so_far < max_ending_here:
			max_so_far = max_ending_here
		if max_ending_here < 0:
			max_ending_here = 0
	return max_so_far

def prefixSum(arr):
	for i in range(1, len(arr)):
		arr[i] = arr[i] + arr[i - 1]
	return arr

def ceil(n, d):
	if n % d == 0:
		return n // d
	else:
		return n // d + 1

def _abs(a, b):
	return int(abs(a - b))

def evenodd(l):
	even = [e for e in l if e & 1 == 0]
	odd = [e for e in l if e & 1]
	return (even, odd)
from collections import Counter
t = int(input())
for _ in range(t):
	(n, k) = list(map(int, input().split()))
	l = list(map(int, input().split()))
	r = []
	for e in l:
		if k % e == 0:
			r.append(k // e)
		else:
			r.append(k // e + 1)
	r = sorted(r)
	index = 1
	group = 0
	for e in r:
		if e == index:
			group += 1
			index = 0
		index += 1
	print(group)


for _ in range(int(input())):
	(n, x) = map(int, input().split())
	arr = list(map(int, input().split()))
	arr = sorted(arr, reverse=True)
	cur = 1
	ct = 0
	for i in arr:
		if cur * i >= x:
			cur = 1
			ct += 1
			continue
		cur += 1
	print(ct)


import math

def solve(arr, x):
	arr.sort(reverse=True)
	n = len(arr)
	cost = [math.ceil(x / v) for v in arr]
	dp = [0] * (n + 1)
	for i in range(1, n + 1):
		dp[i] = max(dp[i], dp[i - 1])
		if i - cost[i - 1] >= 0:
			dp[i] = max(dp[i], dp[i - cost[i - 1]] + 1)
	return dp[n]
tn = int(input())
for ti in range(tn):
	items = input().split()
	n = int(items[0])
	x = int(items[1])
	arr = [int(v) for v in input().split()]
	print(solve(arr, x))


for _ in range(int(input())):
	(n, x) = map(int, input().split())
	lst = [int(x) for x in input().split()]
	lst = sorted(lst)
	group = 0
	i = len(lst) - 1
	while i > 0:
		ln = 1
		while True:
			if ln * lst[i] >= x:
				group += 1
				i -= 1
				break
			else:
				ln += 1
				if i != 0:
					i -= 1
				else:
					break
	if i == 0 and lst[i] >= x:
		group += 1
	print(group)


from math import ceil
p = 10 ** 9 + 7

def main():
	for _ in range(int(input())):
		(n, x) = map(int, input().split())
		a = sorted(map(int, input().split()))
		ans = 0
		m = p
		l = 0
		for i in range(n - 1, -1, -1):
			m = min(m, a[i])
			l += 1
			if m >= ceil(x / l):
				ans += 1
				m = p
				l = 0
		print(ans)
main()


def solve_testcase(n: int, x: int, skills: list):
	skills = sorted(skills, reverse=True)
	new_team_members = 0
	teams = 0
	team_size = 1
	min_skill = (x - 1) // team_size + 1
	for i in range(n):
		new_team_members += 1
		if new_team_members == team_size:
			if skills[i] >= min_skill:
				teams += 1
				new_team_members = 0
			else:
				team_size += 1
				min_skill = (x - 1) // team_size + 1
	print(teams)

def input_testcase():
	(n, x) = [int(term) for term in input().split()]
	skills = [int(term) for term in input().split()]
	return (n, x, skills)
t = int(input())
for i in range(t):
	solve_testcase(*input_testcase())


t = int(input())
for i in range(t):
	(n, x) = map(int, input().split())
	l = list(map(int, input().split()))
	l.sort()
	j = n - 1
	pointer = n
	pointer2 = n - 1
	count = 0
	while j >= 0:
		if l[j] * (pointer - j) >= x:
			pointer = j
			count = count + 1
		j = j - 1
	print(count)


import math
import collections
for _ in range(0, int(input())):
	(n, x) = map(int, input().strip().split())
	l = list(map(int, input().strip().split()))
	hashmap = []
	for i in l:
		if i >= x:
			hashmap.append(0)
		else:
			hashmap.append(int(math.ceil(x / i)))
	res = collections.Counter(hashmap)
	r2 = []
	for key in res.keys():
		r2.append([key, res[key]])
	r2.sort()
	r4 = 0
	for i in range(0, len(r2)):
		if r2[i][0] == 0:
			r4 += r2[i][1]
		else:
			r4 += r2[i][1] // r2[i][0]
			if i != len(r2) - 1:
				r2[i + 1][1] += r2[i][1] % r2[i][0]
	print(r4)


def main():
	t = int(input())
	for _ in range(t):
		(n, x) = map(int, input().split())
		a = list(map(int, input().split()))
		a.sort(reverse=True)
		length = 1
		cnt = 0
		for i in a:
			if i * length >= x:
				cnt += 1
				length = 1
			else:
				length += 1
		print(cnt)
	return
main()


for _ in range(int(input())):
	(n, x) = map(int, input().split())
	lst = list(map(int, input().split()))
	lst = sorted(lst, reverse=True)
	i = 0
	ans = 0
	t = 1
	while i < n:
		if t * lst[i] >= x:
			ans += 1
			t = 1
		else:
			t += 1
		i += 1
	print(ans)


import sys
try:
	t = int(input())
	for _ in range(t):
		(n, x) = map(int, input().split())
		l = [int(x) for x in input().split()]
		i = 0
		l.sort(reverse=True)
		count = 0
		while i < n:
			mn = l[i]
			c = 1
			while i < n and mn * c < x:
				i += 1
				if i < n:
					c += 1
					mn = min(mn, l[i])
			if mn * c >= x:
				count += 1
			i += 1
		print(count)
except EOFError:
	pass


for _ in range(int(input())):
	(n, x) = list(map(int, input().split()))
	arr = sorted(list(map(int, input().split())), reverse=True)
	ans = 0
	current = 1
	for s in arr:
		if s * current >= x:
			ans += 1
			current = 0
		current += 1
	print(ans)


import collections
t = int(input())
for i in range(t):
	(n, x) = map(int, input().split())
	s = list(map(int, input().split()))
	s.sort()
	c = 1
	res = 0
	for i in range(len(s) - 1, -1, -1):
		if s[i] * c >= x:
			res += 1
			c = 1
		else:
			c += 1
	print(res)


t = int(input())
while t > 0:
	(n, x) = [int(i) for i in input().split()]
	a = [int(i) for i in input().split()]
	a = sorted(a)
	j = 1
	count = 0
	for i in range(n - 1, -1, -1):
		if a[i] * j >= x:
			count += 1
			j = 1
		else:
			j += 1
	print(count)
	t -= 1


import math
for _ in range(int(input())):
	(n, x) = input().split()
	n = int(n)
	x = int(x)
	l = list(map(int, input().split()))
	li = [0] * (n + 1)
	for i in l:
		if x / i <= 1:
			li[1] += 1
		elif x / i > n:
			continue
		else:
			li[math.ceil(x / i)] += 1
	ans = 0
	for i in range(1, n + 1):
		ans += li[i] // i
		if i < n:
			li[i + 1] += li[i] % i
	print(ans)


import math
t = int(input().split()[0])
for case in range(t):
	(n, x) = map(int, input().split())
	arr = list(map(int, input().split()))
	teams = [0] * (n + 2)
	for i in range(n):
		people = math.ceil(x / arr[i])
		if people > n:
			continue
		teams[people] += 1
	ans = 0
	for i in range(1, n + 1):
		team = teams[i] // i
		ans += team
		teams[i + 1] += teams[i] - i * team
	print(ans)


t = int(input())
for _ in range(t):
	(n, x) = map(int, input().split())
	a = [int(x) for x in input().split()]
	a.sort(reverse=True)
	l = 1
	c = 0
	for i in a:
		if i * l >= x:
			c += 1
			l = 0
		l += 1
	print(c)


t = int(input())
for test in range(t):
	teams = 0
	(n, x) = input().split()
	(n, x) = (int(n), int(x))
	s = input().split()
	for q in range(n):
		s[q] = int(s[q])
	s.sort(reverse=True)
	team = []
	for i in s:
		team.append(i)
		if team[-1] * len(team) >= x:
			teams += 1
			team = []
	print(teams)


t = int(input())
for _ in range(t):
	(n, x) = map(int, input().split())
	l = list(map(int, input().split()))
	l.sort(reverse=True)
	c = 0
	nl = list()
	for i in range(n):
		if l[i] >= x:
			c += 1
		else:
			nl.append(l[i])
	v = 1
	for i in range(len(nl)):
		if nl[i] * v >= x:
			v = 1
			c += 1
		else:
			v += 1
	print(c)


def merge(arr, l, m, r):
	n1 = m - l + 1
	n2 = r - m
	L = [0] * n1
	R = [0] * n2
	for i in range(0, n1):
		L[i] = arr[l + i]
	for j in range(0, n2):
		R[j] = arr[m + 1 + j]
	i = 0
	j = 0
	k = l
	while i < n1 and j < n2:
		if L[i] <= R[j]:
			arr[k] = L[i]
			i += 1
		else:
			arr[k] = R[j]
			j += 1
		k += 1
	while i < n1:
		arr[k] = L[i]
		i += 1
		k += 1
	while j < n2:
		arr[k] = R[j]
		j += 1
		k += 1

def mergeSort(arr, l, r):
	if l < r:
		m = (l + (r - 1)) // 2
		mergeSort(arr, l, m)
		mergeSort(arr, m + 1, r)
		merge(arr, l, m, r)
t = int(input())
for i in range(t):
	(n, x) = list(map(int, input().split()))
	arr = list(map(int, input().split()))
	mergeSort(arr, 0, n - 1)
	lis = []
	for j in range(n):
		a = x // arr[j]
		b = x % arr[j]
		if b != 0:
			a += 1
		lis.append(a)
	a = [0]
	dp = [0] * (n + 1)
	ans = 0
	for j in range(2, n + 2):
		if lis[-j + 1] > j - a[-1] - 1:
			dp[-j] = dp[-j + 1]
		else:
			ans += 1
			dp[-j] = ans
			a.append(j - 1)
	print(dp[0])


from sys import stdin
input = lambda : stdin.readline().strip()
from collections import deque as d
for _ in range(int(input())):
	(n, x) = map(int, input().split())
	a = sorted(map(int, input().split()), reverse=True)
	r = 0
	c = 0
	for i in a:
		c += 1
		if c * i >= x:
			r += 1
			c = 0
	print(r)


t = int(input())
for _ in range(t):
	(n, x) = map(int, input().split(' '))
	l = list(map(int, input().split(' ')))
	l = sorted(l)
	ans = 0
	count = 1
	for i in range(n - 1, -1, -1):
		if l[i] * count >= x:
			ans += 1
			count = 1
		else:
			count += 1
	print(ans)


def mergeSort(nlist):
	if len(nlist) > 1:
		mid = len(nlist) // 2
		lefthalf = nlist[:mid]
		righthalf = nlist[mid:]
		mergeSort(lefthalf)
		mergeSort(righthalf)
		i = j = k = 0
		while i < len(lefthalf) and j < len(righthalf):
			if lefthalf[i] < righthalf[j]:
				nlist[k] = lefthalf[i]
				i = i + 1
			else:
				nlist[k] = righthalf[j]
				j = j + 1
			k = k + 1
		while i < len(lefthalf):
			nlist[k] = lefthalf[i]
			i = i + 1
			k = k + 1
		while j < len(righthalf):
			nlist[k] = righthalf[j]
			j = j + 1
			k = k + 1
	return nlist
t = int(input())
for i in range(t):
	(n, x) = input().split()
	teams = 0
	l = [int(i) for i in input().split()]
	a = []
	l = mergeSort(l)
	for i in range(len(l) - 1, -1, -1):
		a.append(l[i])
		mini = a[-1]
		if mini * len(a) >= int(x):
			teams += 1
			a = []
	print(teams)


import sys

def answer(n, x, a):
	num = 0
	lindx = -1
	a.sort(reverse=True)
	for i in range(n):
		if (i - lindx) * a[i] >= x:
			num += 1
			lindx = i
	return num

def main():
	t = int(sys.stdin.readline())
	while t:
		(n, x) = map(int, sys.stdin.readline().split())
		a = list(map(int, sys.stdin.readline().split()))
		print(answer(n, x, a))
		t -= 1
	return
main()


for _ in range(int(input())):
	(n, x) = map(int, input().split())
	a = list(map(int, input().split()))
	a.sort()
	i = n - 1
	count = 0
	while i > -1:
		num = 1
		s = a[i] * num
		while s < x:
			num += 1
			i -= 1
			if i == -1:
				break
			s = a[i] * num
		if i > -1:
			count += 1
		i -= 1
	print(count)


for i in range(int(input())):
	(n, x) = map(int, input().split())
	num = list(sorted(map(int, input().split())))
	z = 0
	ans = 0
	for i in range(n):
		z += 1
		if z * num[n - i - 1] >= x:
			ans += 1
			z = 0
	print(ans)


for _ in range(int(input())):
	(n, x) = map(int, input().split())
	lis = list(map(int, input().split()))
	lis = sorted(lis)
	count = 0
	while lis:
		ncount = 0
		mi = 1000000000.0
		while lis and ncount * mi < x:
			mi = lis.pop()
			ncount += 1
		if ncount * mi >= x:
			count += 1
	print(count)


t = int(input(''))
mat = []
nx = []
for i in range(t):
	nx.append(list(map(int, input().split())))
	mat.append(list(map(int, input().split())))
for i in range(t):
	h = nx[i]
	tst = mat[i]
	n = h[0]
	x = h[1]
	tst1 = sorted(tst, reverse=True)
	num = 0
	cnt = 0
	for j in range(len(tst1)):
		num = num + 1
		if num * tst1[j] >= x:
			cnt = cnt + 1
			num = 0
	print(cnt)


for kek in range(int(input())):
	(n, x) = map(int, input().split())
	a = list(map(int, input().split()))
	a.sort()
	for i in range(n):
		f = 0
		if x % a[i] != 0:
			f += 1
		a[i] = x // a[i] + f
	a.sort()
	ans = 0
	com = 1
	for i in a:
		if i == com:
			ans += 1
			com = 1
		else:
			com += 1
	print(ans)


t = int(input())
for test in range(t):
	(n, x) = map(int, input().split())
	a = list(map(int, input().split()))
	a.sort()
	ans = 0
	length = 0
	for i in range(len(a) - 1, -1, -1):
		length += 1
		if length * a[i] >= x:
			length = 0
			ans += 1
	print(ans)


for t in range(int(input())):
	(n, sum1) = map(int, input().split())
	l1 = list(map(int, input().split()))
	l1.sort()
	l2 = []
	team = 0
	if sum(l1) < sum1:
		print(0)
		continue
	while len(l1) > 0:
		l2.append(l1[len(l1) - 1])
		l1.pop(len(l1) - 1)
		if min(l2) * len(l2) >= sum1:
			team += 1
			l2 = []
	print(team)


for _ in range(int(input())):
	(n, x) = map(int, input().split())
	a = list(map(int, input().split()))
	a.sort()
	b = n - 1
	g = 0
	c = 1
	while b >= 0:
		if c * a[b] >= x:
			g += 1
			c = 1
		else:
			c += 1
		b -= 1
	print(g)


for _ in range(int(input())):
	(n, x) = tuple(map(int, input().split()))
	arr = sorted(list(map(int, input().split())))
	arr2 = [x // i if n % i == 0 else x // i + 1 for i in arr]
	(last, cnt) = (n, 0)
	for i in range(n - 1, -1, -1):
		if last - i >= arr2[i]:
			last = i
			cnt += 1
	print(cnt)


t = int(input())
for _ in range(t):
	inp = list(map(int, input().split()))
	x = inp[1]
	inp = list(map(int, input().split()))
	inp.sort()
	ind = 1
	ans = 0
	for i in range(len(inp) - 1, -1, -1):
		if inp[i] >= x:
			ans += 1
		elif inp[i] * ind >= x:
			ans += 1
			ind = 1
		else:
			ind += 1
	print(ans)


t = int(input())
for i in range(t):
	(n, x) = [int(x) for x in input().split()]
	l = [int(x) for x in input().split()]
	l.sort()
	l.reverse()
	ans = 0
	st = 0
	j = 0
	while st + j + 1 <= n:
		if l[st + j] * (j + 1) >= x:
			ans = ans + 1
			st = st + j + 1
			j = 0
		else:
			j = j + 1
	print(ans)


from sys import stdin
inp = lambda : stdin.readline().strip()
t = int(inp())
for _ in range(t):
	(n, x) = [int(x) for x in inp().split()]
	a = [int(x) for x in inp().split()]
	a.sort(reverse=True)
	team = []
	minimum = 10 ** 9 + 1
	ans = 0
	for i in a:
		team.append(i)
		minimum = min(i, minimum)
		if minimum * len(team) >= x:
			ans += 1
			team = []
			minimum = 10 ** 9 + 1
	print(ans)


from math import ceil

def solve(n, x, a):
	i = n - 1
	ans = 0
	c = 1
	while i >= 0:
		p = ceil(x / a[i])
		if p == c:
			ans += 1
			c = 1
		else:
			c += 1
		i -= 1
	return ans
for _ in range(int(input())):
	(n, x) = map(int, input().split())
	a = sorted(list(map(int, input().split())))
	print(solve(n, x, a))


t = int(input())
for i in range(t):
	put = input()
	n = int(put.split()[0])
	x = int(put.split()[1])
	num = 0
	items = 1
	a = list(map(int, input().split()))
	a.sort(reverse=True)
	for z in a:
		if z * items >= x:
			num = num + 1
			items = 0
		items += 1
	print(num)


import math
t = int(input())
for _ in range(t):
	(n, x) = map(int, input().split())
	number_of_teams = 0
	skills = list(map(int, input().split()))
	skills.sort()
	multipliers = []
	for skill in skills:
		multipliers.append(math.ceil(x / skill))
	prev_multiplier = 0
	multipliers_in_a_row = 0
	unused_multipliers = 0
	for multiplier in reversed(multipliers):
		if multiplier == prev_multiplier:
			multipliers_in_a_row += 1
		else:
			unused_multipliers += multipliers_in_a_row
			multipliers_in_a_row = 1
			prev_multiplier = multiplier
		if multipliers_in_a_row + unused_multipliers >= prev_multiplier != 0:
			number_of_teams += 1
			unused_multipliers -= prev_multiplier - multipliers_in_a_row
			multipliers_in_a_row = 0
	print(number_of_teams)


import math
for _ in range(int(input())):
	(n, x) = map(int, input().split())
	A = list(map(int, input().split()))
	A.sort(reverse=True)
	cnt = 0
	ans = 0
	for i in range(n):
		cnt += 1
		if cnt * A[i] >= x:
			ans += 1
			cnt = 0
	print(ans)


for q in range(int(input())):
	(n, x) = map(int, input().split())
	a = list(map(int, input().split()))
	a.sort(reverse=True)
	ans = 0
	cnt = 0
	for i in range(n):
		cnt += 1
		if a[i] * cnt >= x:
			ans += 1
			cnt = 0
	print(ans)


from bisect import *
from collections import *
from math import gcd, ceil, sqrt, floor, inf
from heapq import *
from itertools import *
from operator import add, mul, sub, xor, truediv, floordiv
from functools import *
import os
import sys
from io import BytesIO, IOBase
BUFSIZE = 8192

class FastIO(IOBase):
	newlines = 0

	def __init__(self, file):
		self._fd = file.fileno()
		self.buffer = BytesIO()
		self.writable = 'x' in file.mode or 'r' not in file.mode
		self.write = self.buffer.write if self.writable else None

	def read(self):
		while True:
			b = os.read(self._fd, max(os.fstat(self._fd).st_size, BUFSIZE))
			if not b:
				break
			ptr = self.buffer.tell()
			(self.buffer.seek(0, 2), self.buffer.write(b), self.buffer.seek(ptr))
		self.newlines = 0
		return self.buffer.read()

	def readline(self):
		while self.newlines == 0:
			b = os.read(self._fd, max(os.fstat(self._fd).st_size, BUFSIZE))
			self.newlines = b.count(b'\n') + (not b)
			ptr = self.buffer.tell()
			(self.buffer.seek(0, 2), self.buffer.write(b), self.buffer.seek(ptr))
		self.newlines -= 1
		return self.buffer.readline()

	def flush(self):
		if self.writable:
			os.write(self._fd, self.buffer.getvalue())
			(self.buffer.truncate(0), self.buffer.seek(0))

class IOWrapper(IOBase):

	def __init__(self, file):
		self.buffer = FastIO(file)
		self.flush = self.buffer.flush
		self.writable = self.buffer.writable
		self.write = lambda s: self.buffer.write(s.encode('ascii'))
		self.read = lambda : self.buffer.read().decode('ascii')
		self.readline = lambda : self.buffer.readline().decode('ascii')
(sys.stdin, sys.stdout) = (IOWrapper(sys.stdin), IOWrapper(sys.stdout))
input = lambda : sys.stdin.readline().rstrip('\r\n')

def RL():
	return map(int, sys.stdin.readline().rstrip().split())

def RLL():
	return list(map(int, sys.stdin.readline().rstrip().split()))

def N():
	return int(input())
from types import GeneratorType

def bootstrap(f, stack=[]):

	def wrappedfunc(*args, **kwargs):
		if stack:
			return f(*args, **kwargs)
		else:
			to = f(*args, **kwargs)
			while True:
				if type(to) is GeneratorType:
					stack.append(to)
					to = next(to)
				else:
					stack.pop()
					if not stack:
						break
					to = stack[-1].send(to)
			return to
	return wrappedfunc
farr = [1]
ifa = []

def fact(x, mod=0):
	if mod:
		while x >= len(farr):
			farr.append(farr[-1] * len(farr) % mod)
	else:
		while x >= len(farr):
			farr.append(farr[-1] * len(farr))
	return farr[x]

def ifact(x, mod):
	global ifa
	ifa.append(pow(farr[-1], mod - 2, mod))
	for i in range(x, 0, -1):
		ifa.append(ifa[-1] * i % mod)
	ifa = ifa[::-1]

def per(i, j, mod=0):
	if i < j:
		return 0
	if not mod:
		return fact(i) // fact(i - j)
	return farr[i] * ifa[i - j] % mod

def com(i, j, mod=0):
	if i < j:
		return 0
	if not mod:
		return per(i, j) // fact(j)
	return per(i, j, mod) * ifa[j] % mod

def catalan(n):
	return com(2 * n, n) // (n + 1)

def linc(f, t, l, r):
	while l < r:
		mid = (l + r) // 2
		if t > f(mid):
			l = mid + 1
		else:
			r = mid
	return l

def rinc(f, t, l, r):
	while l < r:
		mid = (l + r + 1) // 2
		if t < f(mid):
			r = mid - 1
		else:
			l = mid
	return l

def ldec(f, t, l, r):
	while l < r:
		mid = (l + r) // 2
		if t < f(mid):
			l = mid + 1
		else:
			r = mid
	return l

def rdec(f, t, l, r):
	while l < r:
		mid = (l + r + 1) // 2
		if t > f(mid):
			r = mid - 1
		else:
			l = mid
	return l

def isprime(n):
	for i in range(2, int(n ** 0.5) + 1):
		if n % i == 0:
			return False
	return True

def binfun(x):
	c = 0
	for w in arr:
		c += ceil(w / x)
	return c

def lowbit(n):
	return n & -n

def inverse(a, m):
	a %= m
	if a <= 1:
		return a
	return (1 - inverse(m, a) * m) // a % m

class BIT:

	def __init__(self, arr):
		self.arr = arr
		self.n = len(arr) - 1

	def update(self, x, v):
		while x <= self.n:
			self.arr[x] += v
			x += x & -x

	def query(self, x):
		ans = 0
		while x:
			ans += self.arr[x]
			x &= x - 1
		return ans

class DSU:

	def __init__(self, n):
		self.c = [-1] * n

	def same(self, x, y):
		return self.find(x) == self.find(y)

	def find(self, x):
		if self.c[x] < 0:
			return x
		self.c[x] = self.find(self.c[x])
		return self.c[x]

	def union(self, u, v):
		(u, v) = (self.find(u), self.find(v))
		if u == v:
			return False
		if self.c[u] < self.c[v]:
			(u, v) = (v, u)
		self.c[u] += self.c[v]
		self.c[v] = u
		return True

	def size(self, x):
		return -self.c[self.find(x)]

class UFS:

	def __init__(self, n):
		self.parent = [i for i in range(n)]
		self.ranks = [0] * n

	def find(self, x):
		if x != self.parent[x]:
			self.parent[x] = self.find(self.parent[x])
		return self.parent[x]

	def union(self, u, v):
		(pu, pv) = (self.find(u), self.find(v))
		if pu == pv:
			return False
		if self.ranks[pu] >= self.ranks[pv]:
			self.parent[pv] = pu
			if self.ranks[pv] == self.ranks[pu]:
				self.ranks[pu] += 1
		else:
			self.parent[pu] = pv

def Prime(n):
	c = 0
	prime = []
	flag = [0] * (n + 1)
	for i in range(2, n + 1):
		if not flag[i]:
			prime.append(i)
			c += 1
		for j in range(c):
			if i * prime[j] > n:
				break
			flag[i * prime[j]] = prime[j]
			if i % prime[j] == 0:
				break
	return prime

def dij(s, graph):
	d = {}
	d[s] = 0
	heap = [(0, s)]
	seen = set()
	while heap:
		(dis, u) = heappop(heap)
		if u in seen:
			continue
		for v in graph[u]:
			if v not in d or d[v] > d[u] + graph[u][v]:
				d[v] = d[u] + graph[u][v]
				heappush(heap, (d[v], v))
	return d

def GP(it):
	return [(ch, len(list(g))) for (ch, g) in groupby(it)]

class DLN:

	def __init__(self, val):
		self.val = val
		self.pre = None
		self.next = None
t = N()
for i in range(t):
	(n, x) = RL()
	a = RLL()
	a.sort(reverse=True)
	c = 0
	ans = 0
	for i in range(n):
		c += 1
		if c * a[i] >= x:
			c = 0
			ans += 1
	print(ans)


test_case = int(input())
for _ in range(test_case):
	(n, k) = map(int, input().split())
	arr = sorted(list(map(int, input().split())))
	count = 1
	team = 0
	for i in range(len(arr) - 1, -1, -1):
		if arr[i] * count >= k:
			team += 1
			count = 1
		else:
			count += 1
	print(team)


def use_fast_io():
	import sys

	class InputStorage:

		def __init__(self, lines):
			lines.reverse()
			self.lines = lines

		def input_func(self):
			if self.lines:
				return self.lines.pop()
			else:
				return ''
	input_storage_obj = InputStorage(sys.stdin.readlines())
	return input_storage_obj.input_func
input = use_fast_io()
t = int(input())
for __ in range(t):
	(n, x) = map(int, input().split())
	arr = list(map(int, input().split()))
	arr.sort()
	team_count = 0
	while arr:
		cur_count = 1
		cur_val = arr.pop()
		while arr and cur_count * cur_val < x:
			cur_val = arr.pop()
			cur_count += 1
		if cur_count * cur_val >= x:
			team_count += 1
	print(team_count)


for _ in range(int(input())):
	(n, x) = map(int, input().split())
	ar = list(map(int, input().split()))
	c = 0
	k = []
	pos = 0
	ar.sort(reverse=True)
	for i in range(n):
		if ar[i] >= x:
			c += 1
		else:
			break
	k = ar[c:]
	pos = 0
	for i in range(len(k)):
		if k[i] * (i + 1 - pos) >= x:
			c += 1
			pos = i + 1
	print(c)


t = int(input())
for _ in range(t):
	(n, x) = list(map(int, input().strip().split()))
	list1 = list(map(int, input().strip().split()))
	list1.sort()
	list1.reverse()
	teams = 0
	count = 0
	for i in range(len(list1)):
		count += 1
		if list1[i] * count >= x:
			teams += 1
			count = 0
	print(teams)


import sys
input = sys.stdin.buffer.readline
a = int(input())
for x in range(a):
	(b, c) = map(int, input().split())
	d = list(map(int, input().split()))
	j = []
	h = 0
	for y in range(b):
		if d[y] < c:
			j.append(d[y])
			h += 1
	s = b - h
	j.sort(reverse=True)
	l = 1
	for x in range(h):
		if l * j[x] >= c:
			s += 1
			l = 1
		else:
			l += 1
	print(s)


for t in range(int(input())):
	(n, x) = map(int, input().split())
	a = list(map(int, input().split()))
	a = sorted(a, reverse=True)
	pref = [0 for i in range(n)]
	for i in range(n):
		pref[i] = (x + a[i] - 1) // a[i]
	teams = 0
	start = 0
	for i in range(n):
		if i - start + 1 >= pref[i]:
			teams += 1
			start = i + 1
	print(teams)


for _ in range(int(input())):
	(n, x) = map(int, input().split())
	l = list(map(int, input().split()))
	l.sort(reverse=True)
	ans = 0
	cc = 0
	for e in l:
		if e >= x:
			ans += 1
		else:
			cc += 1
			if cc * e >= x:
				ans += 1
				cc = 0
	print(ans)


t = int(input())
for _ in range(t):
	(n, x) = map(int, input().split())
	a = [int(i) for i in input().split()]
	a.sort()
	res = 0
	acc = 0
	min_el = float('inf')
	for i in range(n - 1, -1, -1):
		if a[i] >= x:
			res += 1
			min_el = float('inf')
			acc = 0
		else:
			acc += 1
			if min_el > a[i]:
				min_el = a[i]
		if acc * min_el >= x:
			res += 1
			min_el = float('inf')
			acc = 0
	print(res)


t = int(input())
while t > 0:
	t -= 1
	(n, skill) = map(int, input().split())
	ppl = [int(x) for x in input().split()]
	ppl.sort()
	ppl = ppl[::-1]
	(count, teams) = (0, 0)
	for p in ppl:
		if p > skill:
			teams += 1
		else:
			count += 1
			if p * count >= skill:
				teams += 1
				count = 0
	print(teams)


from sys import *
t = int(stdin.readline())
while t > 0:
	(n, x) = map(int, stdin.readline().split())
	arr = list(map(int, stdin.readline().split()))
	arr.sort(reverse=True)
	count = 0
	de = 1
	for i in arr:
		if i * de >= x:
			count += 1
			de = 0
		de += 1
	print(count)
	t -= 1


import random

def gcd(a, b):
	if a == 0:
		return b
	return gcd(b % a, a)

def lcm(a, b):
	return a * b / gcd(a, b)
for _ in range(int(input())):
	(n, x) = map(int, input().split())
	a = list(map(int, input().split()))
	a.sort()
	c = 0
	start = n - 1
	for i in range(n - 1, -1, -1):
		if a[i] * (-i + start + 1) >= x:
			start = i - 1
			c += 1
	print(c)


from sys import stdout
from sys import stdin

def get():
	return stdin.readline().strip()

def getf():
	return [int(i) for i in get().split()]

def put(a, end='\n'):
	stdout.write(str(a) + end)

def putf(a, sep=' ', end='\n'):
	stdout.write(sep.join(map(str, a)) + end)

def solve(a, n, x):
	r = n
	ans = 0
	for i in range(n - 1, -1, -1):
		if a[i] * (r - i) >= x:
			r = i
			ans += 1
	return ans

def main():
	t = int(get())
	for i in range(t):
		(n, x) = getf()
		a = getf()
		put(solve(sorted(a), n, x))
main()


def sint():
	return int(input())

def sints():
	return map(int, input().split())

def sara():
	return list(map(int, input().split()))

def sstr():
	s = input()
	return list(s[:len(s)])

def main():
	tt = sint()
	while tt:
		tt -= 1
		(n, x) = sints()
		ara = sara()
		ara.sort()
		i = n - 1
		cnt = 0
		while i >= 0:
			t = 0
			while i >= 0:
				t += 1
				if ara[i] * t >= x:
					cnt += 1
					t = 0
				i -= 1
				if t == 0:
					break
		print(cnt)
main()


import sys
input = lambda : sys.stdin.readline().rstrip()
for _ in range(int(input())):
	(n, x) = map(int, input().split())
	a = sorted([int(x) for x in input().split()])
	ans = 0
	while a and a[-1] >= x:
		ans += 1
		a.pop()
	i = len(a) - 1
	l = 1
	while i >= 0:
		if a[i] * l >= x:
			ans += 1
			l = 0
		i -= 1
		l += 1
	print(ans)


def fact(x):
	if x == 0:
		return 1
	else:
		return x * fact(x - 1)

def lower_bound(li, num):
	answer = -1
	start = 0
	end = len(li) - 1
	while start <= end:
		middle = (end + start) // 2
		if li[middle] >= num:
			answer = middle
			end = middle - 1
		else:
			start = middle + 1
	return answer

def upper_bound(li, num):
	answer = -1
	start = 0
	end = len(li) - 1
	while start <= end:
		middle = (end + start) // 2
		if li[middle] <= num:
			answer = middle
			start = middle + 1
		else:
			end = middle - 1
	return answer

def abs(x):
	return x if x >= 0 else -x

def binary_search(li, val, lb, ub):
	ans = 0
	while lb <= ub:
		mid = (lb + ub) // 2
		if li[mid] > val:
			ub = mid - 1
		elif val > li[mid]:
			lb = mid + 1
		else:
			ans = 1
			break
	return ans

def sieve_of_eratosthenes(n):
	ans = []
	arr = [1] * (n + 1)
	(arr[0], arr[1], i) = (0, 0, 2)
	while i * i <= n:
		if arr[i] == 1:
			j = i + i
			while j <= n:
				arr[j] = 0
				j += i
		i += 1
	for k in range(n):
		if arr[k] == 1:
			ans.append(k)
	return ans

def nc2(x):
	if x == 1:
		return 0
	else:
		return x * (x - 1) // 2

def kadane(x):
	sum_so_far = 0
	current_sum = 0
	for i in x:
		current_sum += i
		if current_sum < 0:
			current_sum = 0
		else:
			sum_so_far = max(sum_so_far, current_sum)
	return sum_so_far

def mex(li):
	check = [0] * 1001
	for i in li:
		check[i] += 1
	for i in range(len(check)):
		if check[i] == 0:
			return i

def sumdigits(n):
	ans = 0
	while n != 0:
		ans += n % 10
		n //= 10
	return ans
from math import *
for _ in range(int(input())):
	(n, x) = map(int, input().split())
	a = list(map(int, input().split()))
	a.sort()
	i = n - 1
	size = 0
	cnt = 0
	while i > -1:
		size += 1
		if a[i] * size >= x:
			cnt += 1
			size = 0
		i -= 1
	print(cnt)


import sys
import math

def II():
	return int(sys.stdin.readline())

def LI():
	return list(map(int, sys.stdin.readline().split()))

def MI():
	return map(int, sys.stdin.readline().split())

def SI():
	return sys.stdin.readline().strip()
t = II()
for q in range(t):
	(n, x) = MI()
	a = sorted(LI())
	a = a[::-1]
	l = 0
	count = 1
	ans = 0
	while l < n:
		if count * a[l] >= x:
			ans += 1
			count = 1
		else:
			count += 1
		l += 1
	print(ans)


T = int(input())
for t in range(T):
	(n, x) = map(int, input().split())
	a = list(map(int, input().split()))
	a.sort(reverse=True)
	cnt = 0
	size = 1
	for e in a:
		if e * size >= x:
			cnt += 1
			size = 1
		else:
			size += 1
	print(cnt)


a = int(input())
for i in range(a):
	(n, x) = map(int, input().split())
	l = list(map(int, input().split()))
	l.sort()
	l.reverse()
	s = 0
	k = 1
	for j in l:
		if j * k >= x:
			k = 0
			s += 1
		k += 1
	print(s)


from sys import stdin, gettrace
if gettrace():
	inputi = input
else:

	def input():
		return next(stdin)[:-1]

	def inputi():
		return stdin.buffer.readline()

def solve():
	(n, x) = map(int, inputi().split())
	aa = [int(a) for a in inputi().split()]
	aa.sort()
	np = 0
	res = 0
	while aa:
		np += 1
		a = aa.pop()
		if a * np >= x:
			res += 1
			np = 0
	print(res)

def main():
	t = int(inputi())
	for _ in range(t):
		solve()
main()


for _ in range(int(input())):
	(n, m) = map(int, input().split(' '))
	l = list(map(int, input().split(' ')))
	l.sort()
	a = 0
	c = 1
	for i in range(n - 1, -1, -1):
		if l[i] * c >= m:
			a = a + 1
			c = 1
		else:
			c = c + 1
	print(a)


for _ in range(int(input())):
	(x, y) = [int(a) for a in input().split()]
	ar = list(map(int, input().split()))[:x]
	ar.sort(reverse=True)
	s = 0
	k = 0
	for i in range(x):
		if ar[i] >= y:
			s = s + 1
		elif (k + 1) * ar[i] >= y:
			k = 0
			s = s + 1
		else:
			k = k + 1
	print(s)


import sys

def input():
	return sys.stdin.readline().rstrip()

def input_split():
	return [int(i) for i in input().split()]
testCases = int(input())
answers = []
for _ in range(testCases):
	(n, x) = input_split()
	arr = input_split()
	arr.sort()
	arr.reverse()
	num_teams = 0
	done = False
	current = 0
	while current < n:
		count = 1
		while arr[current] * count < x:
			current += 1
			count += 1
			if current >= n:
				done = True
				break
		if done:
			break
		num_teams += 1
		current += 1
	ans = num_teams
	answers.append(ans)
print(*answers, sep='\n')


def solve(a, n, x):
	a.sort(reverse=True)
	cnt = 0
	l = 0
	for v in a:
		need = (x + v - 1) // v - 1
		if l >= need:
			l -= need
			cnt += 1
		else:
			l += 1
	return cnt
tests = int(input())
for test in range(tests):
	(n, x) = map(int, input().split())
	a = list(map(int, input().split()))
	print(solve(a, n, x))


def f(a, b):
	if a % b == 0:
		return a // b
	else:
		return a // b + 1
t = int(input())
while t > 0:
	t = t - 1
	(n, x) = map(int, input().split())
	a = input()
	A = list(map(int, list(a.split())))
	A.sort()
	table = [0] * n
	b = [0] * n
	for i in range(n):
		b[i] = f(x, A[i])
	for i in range(n - 1, -1, -1):
		if b[i] > n - i:
			table[i] = 0
		elif b[i] == n - i:
			table[i] = 1
		else:
			table[i] = 1 + table[i + b[i]]
	print(max(table))


TC = int(input())
for tc in range(TC):
	(N, X) = map(int, input().split())
	A = list(map(int, input().split()))
	A.sort(reverse=True)
	result = 0
	c = 1
	for a in A:
		if c * a >= X:
			result += 1
			c = 0
		c += 1
	print(result)


from collections import defaultdict as dd
from collections import deque
import bisect
import heapq

def ri():
	return int(input())

def rl():
	return list(map(int, input().split()))
q = ri()
for _ in range(q):
	(n, k) = rl()
	a = rl()
	a.sort(reverse=True)
	d = deque(a)
	ans = 0
	l = 1
	while l <= len(d):
		if d[l - 1] * l >= k:
			ans += 1
			for _ in range(l):
				d.popleft()
		else:
			l += 1
	print(ans)


from sys import stdin, stdout
import math, queue, heapq
fastinput = stdin.readline
fastout = stdout.write
t = int(fastinput())
while t:
	t -= 1
	(n, x) = map(int, fastinput().split())
	a = list(map(int, fastinput().split()))
	a.sort(reverse=True)
	teamcount = 0
	tempteammember = 0
	minqualityperson = 0
	for i in a:
		tempteammember += 1
		minqualityperson = i
		if tempteammember * minqualityperson >= x:
			teamcount += 1
			tempteammember = 0
			minqualityperson = 0
	print(teamcount)


from math import ceil
for testcase in range(int(input())):
	(n, x) = map(int, input().split())
	ans = 0
	l = [int(x) for x in input().split()]
	a = []
	for i in l:
		if i >= x:
			ans += 1
		else:
			a.append(i)
	a.sort(reverse=True)
	i = 0
	done = 0
	while i < len(a):
		temp = ceil(x / a[i])
		if i + 1 - done >= temp:
			done += temp
			ans += 1
		i += 1
	print(ans)


t = int(input())
while t > 0:
	t = t - 1
	q = input().split()
	n = int(q[0])
	x = int(q[1])
	a = input().split()
	for i in range(0, n):
		a[i] = int(a[i])
	a.sort(reverse=True)
	l = 1
	count = 0
	for i in range(0, n):
		if l * a[i] >= x:
			count = count + 1
			l = 1
		else:
			l = l + 1
	print(count)


import math
import sys
input = sys.stdin.readline
t = int(input())
for cs in range(t):
	(n, x) = map(int, input().split())
	a = sorted([int(_) for _ in input().split()], reverse=True)
	ans = 0
	cur = 0
	while cur < n:
		take = 1
		while cur < n and take * a[cur] < x:
			take += 1
			cur += 1
		if cur < n and take * a[cur] >= x:
			ans += 1
		cur += 1
	print(ans)


for _ in range(int(input())):
	(n, b) = map(int, input().split())
	arr = list(map(int, input().split()))
	arr.sort()
	arr.reverse()
	p = 0
	ct = 0
	ans = 0
	for i in range(n):
		p += arr[i]
		ct += 1
		if ct * arr[i] >= b:
			ct = 0
			p = 0
			ans += 1
	print(ans)


t = int(input())
for _ in range(t):
	(n, x) = map(int, input().split())
	prog = list(map(int, input().split()))
	prog.sort(reverse=True)
	count = 0
	team = 0
	for i in range(n):
		team += 1
		if team * prog[i] >= x:
			count += 1
			team = 0
	print(count)


for _ in range(int(input())):
	(n, x) = list(map(int, input().split()))
	a = list(map(int, input().split()))
	d = []
	for i in a:
		if x % i == 0:
			d.append(x // i)
		else:
			d.append((x + i - 1) // i)
	(ans, need, k) = (0, -1, 0)
	d.sort()
	for i in d:
		if need == 0:
			ans += 1
			k = 0
		if i > need:
			need = i - k
		k += 1
		need -= 1
	if need == 0:
		ans += 1
	print(ans)


for _ in range(int(input())):
	(n, x) = map(int, input().split())
	l = list(map(int, input().split()))
	l.sort(reverse=True)
	ans = 0
	t = -1
	for i in range(n):
		if l[i] >= x:
			ans += 1
		else:
			t = i
			break
	if t == -1:
		print(ans)
	else:
		c = 1
		for i in range(t, n):
			if l[i] * c >= x:
				ans += 1
				c = 1
			else:
				c += 1
		print(ans)


for cn in range(1, int(input()) + 1):
	(n, x) = map(int, input().split())
	S = list(map(int, input().split()))
	S = reversed(sorted(S))
	curr = 0
	num_teams = 0
	for s in S:
		curr += 1
		if curr * s >= x:
			num_teams += 1
			curr = 0
	print(num_teams)


def find(A, x):
	if min(A) >= x:
		return len(A)
	A = sorted(A)[::-1]
	ans = 0
	for i in range(len(A)):
		if A[i] < x:
			break
		else:
			ans += 1
	cur_len = 1
	for j in range(i + 1, len(A)):
		cur_len += 1
		if cur_len * A[j] >= x:
			ans += 1
			cur_len = 0
	return ans
for _ in range(int(input())):
	(n, x) = list(map(int, input().strip().split()))
	A = list(map(int, input().strip().split()))
	print(find(A, x))


import bisect as bi
import math as mt
import collections as cc
I = lambda : list(map(int, input().split()))
for tc in range(int(input())):
	(n, x) = I()
	l = sorted(I())[::-1]
	ans = 0
	i = 0
	while i < n:
		if l[i] >= x:
			ans += 1
			i += 1
			continue
		j = 0
		while i < n:
			j += 1
			if l[i] * j >= x:
				ans += 1
				i += 1
				break
			i += 1
	print(ans)


import math
t = int(input())
for w in range(t):
	(n, x) = (int(i) for i in input().split())
	l = sorted([int(i) for i in input().split()], reverse=True)
	c = 0
	c1 = 0
	for i in range(n):
		c1 += 1
		if l[i] * c1 >= x:
			c += 1
			c1 = 0
	print(c)


import io
import os
input = io.BytesIO(os.read(0, os.fstat(0).st_size)).readline

def solve():
	(n, x) = map(int, input().split())
	a = list(map(int, input().split()))
	a.sort()
	b = -1
	c = 0
	for i in range(n - 1, -1, -1):
		if a[i] < x:
			b = i
			break
		else:
			c += 1
	d = 1
	i = b
	while i >= 0:
		if a[i] * d < x:
			d += 1
		else:
			c += 1
			d = 1
		i -= 1
	print(c)

def main():
	for t in range(int(input())):
		solve()
main()


var_d = lambda : map(int, input().split())
(V,) = var_d()
while V:
	(an, ax) = var_d()
	var_a = sorted(var_d())
	iy = 0
	while var_a:
		var_c = 1
		while var_a and var_c * var_a[-1] < ax:
			var_c += 1
			var_a.pop()
		if var_a:
			iy += 1
			var_a.pop()
	print(iy)
	V -= 1


from math import ceil
t = int(input())
while t:
	(n, x) = [int(i) for i in input().split()]
	a = [int(i) for i in input().split()]
	a.sort()
	left = 0
	teams = 0
	for i in range(n - 1, -1, -1):
		need = ceil(x / a[i])
		if 1 + left >= need:
			teams += 1
			left = left + 1 - need
		else:
			left += 1
	print(teams)
	t -= 1


from math import ceil
for _ in range(int(input())):
	(n, x) = [int(i) for i in input().split()]
	a = [int(i) for i in input().split()]
	a.sort(reverse=True)
	c = 0
	k = 1
	for i in range(n):
		if a[i] * k >= x:
			c = c + 1
			k = 1
		else:
			k = k + 1
	print(c)


for tc in range(int(input())):
	(n, x) = input().split(' ')
	(n, x) = (int(n), int(x))
	A = input().split(' ')
	for i in range(n):
		A[i] = int(A[i])
	A.sort(reverse=True)
	ans = 0
	start = 0
	end = 0
	while start < n:
		while end < n and A[end] * (end - start + 1) < x:
			end += 1
		if end < n and A[end] * (end - start + 1) >= x:
			ans += 1
		start = end + 1
	print(ans)


t = int(input())
for _ in range(t):
	(n, x) = map(int, input().split())
	a = sorted(list(map(int, input().split())), reverse=True)
	output = 0
	count = 1
	for i in a:
		if i * count >= x:
			output += 1
			count = 0
		count += 1
	print(output)


import sys
input = sys.stdin.readline
from collections import *
for _ in range(int(input())):
	(n, x) = map(int, input().split())
	a = list(map(int, input().split()))
	a.sort()
	dp = [0] * (n + 1)
	for i in range(n):
		dp[i + 1] = max(dp[i + 1], dp[i])
		j = (x + a[i] - 1) // a[i]
		if i + j <= n:
			dp[i + j] = max(dp[i + j], dp[i] + 1)
	print(dp[n])


import math
t = int(input())
rez = []
for i in range(t):
	A = input().split(' ')
	n = int(A[0])
	x = int(A[1])
	com = 0
	k = 0
	a = input().split(' ')
	for j in range(n):
		a[j] = int(a[j])
	a.sort(reverse=True)
	for j in range(n):
		k += 1
		if int(math.ceil(x / a[j])) == k:
			com += 1
			k = 0
	rez.append(com)
for i in range(len(rez)):
	print(rez[i])


def solve():
	(n, x) = map(int, input().split())
	lst = list(map(int, input().split()))
	lst2 = [[i, (x + i - 1) // i] for i in lst]
	lst2.sort(reverse=True)
	havepeop = 0
	ans = 0
	for (a, i) in lst2:
		havepeop += 1
		if havepeop >= i:
			ans += 1
			havepeop -= i
	print(ans)
for i in range(int(input())):
	solve()


for _ in range(int(input())):
	(n, x) = map(int, input().split())
	a = [int(x) for x in input().split()]
	a.sort(reverse=True)
	prev = -1
	ans = 0
	for i in range(n):
		if a[i] * (i - prev) >= x:
			ans += 1
			prev = i
	print(ans)


for _ in range(int(input())):
	(n, x) = map(int, input().split())
	lis = list(map(int, input().split()))
	lis.sort()
	to = 0
	co = 1
	for i in range(n - 1, -1, -1):
		if co * lis[i] >= x:
			co = 1
			to += 1
		else:
			co += 1
	print(to)


from os import path
import sys
from heapq import heappush, heappop
from functools import cmp_to_key as ctk
from collections import deque, defaultdict as dd
from bisect import bisect, bisect_left, bisect_right, insort, insort_left, insort_right
from itertools import permutations
from datetime import datetime
from math import ceil, sqrt, log, gcd

def ii():
	return int(input())

def si():
	return input()

def mi():
	return map(int, input().split())

def li():
	return list(mi())
abc = 'abcdefghijklmnopqrstuvwxyz'
mod = 1000000007
inf = float('inf')
vow = ['a', 'e', 'i', 'o', 'u']
(dx, dy) = ([-1, 1, 0, 0], [0, 0, 1, -1])

def bo(i):
	return ord(i) - ord('a')
file = 1

def solve():
	for _ in range(ii()):
		(n, x) = mi()
		a = li()
		a.sort(reverse=True)
		ans = 0
		c = 1
		mnx = inf
		for i in range(n):
			mnx = min(mnx, a[i])
			if mnx * c >= x:
				ans += 1
				c = 1
				mnx = inf
			else:
				c += 1
		print(ans)
if file:
	if path.exists('input1.txt'):
		sys.stdin = open('input1.txt', 'r')
		sys.stdout = open('output1.txt', 'w')
	else:
		input = sys.stdin.readline
solve()


t = int(input())
for _ in range(t):
	(n, x) = map(int, input().split())
	a = list(map(int, input().split()))
	a.sort(reverse=True)
	ct = 0
	group_size = 1
	for i in range(n):
		if a[i] * group_size >= x:
			ct += 1
			group_size = 1
		else:
			group_size += 1
	print(ct)


from collections import deque

def ri():
	return int(input())

def rl():
	return list(map(int, input().split()))
t = ri()
for _ in range(t):
	(n, x) = rl()
	a = rl()
	a.sort(reverse=True)
	b = deque(a)
	l = 1
	ans = 0
	while l <= len(b):
		if b[l - 1] * l >= x:
			ans += 1
			for k in range(l):
				b.popleft()
		else:
			l += 1
	print(ans)


t = int(input())
for i in range(t):
	(n, x) = map(int, input().split(' '))
	num = input().split(' ')
	nums = []
	for j in num:
		nums.append(int(j))
	nums.sort(reverse=True)
	ans = 0
	length = 1
	for j in range(n):
		if nums[j] * length >= x:
			ans += 1
			length = 1
		else:
			length += 1
	print(ans)


tc = int(input())
while tc > 0:
	tc -= 1
	(n, x) = map(int, input().split())
	k = list(map(int, input().split()))
	k = sorted(k, reverse=True)
	item = 1
	ct = 0
	for i in k:
		if i * item >= x:
			item = 0
			ct += 1
		item += 1
	print(ct)


import math
t = int(input())
for hh in range(0, t):
	(n, x) = [int(x) for x in input().split()]
	a = [int(x) for x in input().split()]
	a.sort()
	i = 0
	j = n - 1
	cnt = 0
	ans = 0
	dp = [0] * n
	while j >= 0:
		cnt = 0
		prod = 0
		while prod < x and j >= 0:
			mn = a[j]
			j -= 1
			cnt += 1
			prod = mn * cnt
		if prod >= x:
			ans += 1
	print(ans)


t = int(input())
for _ in range(t):
	(n, x) = map(int, input().split())
	a = list(map(int, input().split()))
	a.sort(reverse=True)
	ans = 0
	i = 0
	while i < n:
		num = 1
		while i < n and a[i] * num < x:
			i += 1
			num += 1
		if i < n:
			ans += 1
			i += 1
	print(ans)


for h in range(int(input())):
	(n, x) = map(int, input().strip().split())
	arr = list(map(int, input().strip().split()))
	arr.sort(key=lambda x: -x)
	l = 1
	ans = 0
	for i in range(n):
		if arr[i] * l >= x:
			ans += 1
			l = 1
		else:
			l += 1
	print(ans)


for _ in range(int(input())):
	(n, x) = map(int, input().split())
	arr = list(map(int, input().split()))
	arr.sort(reverse=True)
	count = 0
	while n > 0:
		l = 1
		while n > 0 and arr[0] * l < x:
			arr.pop(0)
			l += 1
			n -= 1
		if n > 0 and arr[0] * l >= x:
			arr.pop(0)
			n -= 1
			count += 1
	print(count)


t = int(input())
for test_case in range(t):
	(n, x) = [int(x) for x in input().split()]
	res = 0
	a = []
	a = [int(y) for y in input().split()]
	a.sort()
	ind = 0
	for i in range(n - 1, -1, -1):
		if a[i] >= x:
			res += 1
			ind += 1
	m = len(a) - 1 - ind
	sum = 1
	while m > 0:
		sum = 1
		for i in range(m, -1, -1):
			if sum * a[i] >= x:
				res += 1
				m -= 1
				break
			else:
				sum += 1
				m -= 1
	print()
	print(res)
	print()


def lower_bound(a, ele):
	l = 0
	r = len(a) - 1
	n = len(a)
	ans = n
	while l <= r:
		mid = l + (r - l) // 2
		if a[mid] >= ele:
			r = mid - 1
			ans = mid
		else:
			l = mid + 1
	return ans
T = int(input())
for ii in range(T):
	(n, k) = map(int, input().split())
	a = list(map(int, input().split()))
	a.sort()
	x = lower_bound(a, k)
	ans = n - x
	a = a[:x]
	l = 0
	for i in a[-1::-1]:
		l += 1
		if l * i >= k:
			ans += 1
			l = 0
	print(ans)


for _ in range(int(input())):
	(n, x) = map(int, input().split())
	array = list(map(int, input().split()))
	array.sort(reverse=True)
	team = 0
	pre = 0
	count = 0
	for i in array:
		pre += i
		count += 1
		if i * count >= x:
			team += 1
			pre = 0
			count = 0
	print(team)


for _ in range(int(input())):
	(n, x) = map(int, input().split())
	skill_list = sorted(list(map(int, input().split())), reverse=True)
	(teams, width) = (0, 1)
	for skill in skill_list:
		if skill * width >= x:
			teams += 1
			width = 0
		width += 1
	print(teams)


T = int(input())
for _ in range(T):
	(N, x) = map(int, input().split())
	arr = [int(i) for i in input().split()]
	arr = sorted(arr)
	count = 1
	teams = 0
	for num in reversed(arr):
		if num * count >= x:
			teams += 1
			count = 1
		else:
			count += 1
	print(teams)


for x in range(int(input())):
	(n, k) = list(map(int, input().split()))
	m = list(map(int, input().split()))
	m.sort(reverse=True)
	l = 0
	z = 0
	j = 0
	for i in range(n):
		z += 1
		if z * m[i] >= k:
			l += 1
			z = 0
	print(l)


import os
os_input = os.read(0, int(10000000.0)).split()
os_input_pos = -1
answer_list = []

def read_s():
	global os_input_pos
	os_input_pos += 1
	return os_input[os_input_pos].decode()

def read_i():
	return int(read_s())

def write_s(v):
	answer_list.append(v)

def write_i(v):
	write_s(str(v))

def print_ans():
	os.write(1, '\n'.join(answer_list).encode())
	os.write(1, '\n'.encode())
from types import GeneratorType

def iterative(f, stack=[]):

	def wrapped_func(*args, **kwargs):
		if stack:
			return f(*args, **kwargs)
		to = f(*args, **kwargs)
		while True:
			if type(to) is GeneratorType:
				stack.append(to)
				to = next(to)
			else:
				stack.pop()
				if not stack:
					break
				to = stack[-1].send(to)
		return to
	return wrapped_func
T = read_i()
while T:
	T -= 1
	n = read_i()
	x = read_i()
	a = reversed(sorted([read_i() for i in range(n)]))
	ans = 0
	cnt = 0
	for v in a:
		cnt += 1
		if cnt * v >= x:
			ans += 1
			cnt = 0
	write_i(ans)
print_ans()


z = input
mod = 10 ** 9 + 7
from collections import *
from queue import *
from sys import *
from collections import *
from math import *
from heapq import *
from itertools import *
from bisect import *
from collections import Counter as cc
from math import factorial as f

def lcd(xnum1, xnum2):
	return xnum1 * xnum2 // gcd(xnum1, xnum2)
for _ in range(int(z())):
	(a, b) = map(int, z().split())
	l = sorted(list(map(int, z().split())))[::-1]
	c = 0
	lp = []
	d = 0
	for i in range(a):
		x = l[i]
		lp.append(x)
		if len(lp) * l[i] >= b:
			c += 1
			lp = []
	print(c)


def multiple_input():
	return map(int, input().split())

def list_input():
	return list(map(int, input().split()))
for _ in range(int(input())):
	(n, x) = multiple_input()
	a = list_input()
	a.sort(reverse=True)
	i = 0
	ans = 0
	while i < n:
		if a[i] >= x:
			ans += 1
		else:
			count = 1
			flag = 0
			while True:
				if a[i] * count >= x:
					flag = 1
					break
				else:
					count += 1
					i += 1
				if i == n:
					break
			if flag == 1:
				ans += 1
		i += 1
	print(ans)


(z, zz) = (input, lambda : list(map(int, z().split())))
mod = 10 ** 9 + 7
from string import *
from collections import *
from queue import *
from sys import *
from collections import *
from math import *
from heapq import *
from itertools import *
from bisect import *
from collections import Counter as cc
from math import factorial as f

def lcd(xnum1, xnum2):
	return xnum1 * xnum2 // gcd(xnum1, xnum2)

def prime(x):
	p = ceil(x ** 0.5) + 1
	for i in range(2, p):
		if x % i == 0:
			return 0
	return 1
(z, zz) = (input, lambda : list(map(int, z().split())))
for _ in range(int(z())):
	(a, b) = zz()
	l = sorted(zz())
	p = []
	c = 0
	for i in l[::-1]:
		if i >= b:
			c += 1
		else:
			p.append(i)
			if len(p) * i >= b:
				c += 1
				p = []
	print(c)


import math
import heapq
I = lambda : list(map(int, input().split(' ')))
for _ in range(int(input())):
	(n, x) = I()
	lst = I()
	heap = []
	for i in range(n):
		heapq.heappush(heap, -lst[i])
	grps = 0
	while len(heap) > 0:
		k = 0
		cur = 0
		while cur * k < x and len(heap) > 0:
			cur = -heapq.heappop(heap)
			k += 1
		if cur * k >= x:
			grps += 1
	print(grps)


import sys
input = sys.stdin.readline

def inp():
	return int(input())

def inlt():
	return list(map(int, input().split()))

def insr():
	s = input()
	return s[:len(s) - 1]

def invr():
	return map(int, input().split())

def solve(dim, t):
	(n, x) = dim
	t.sort()
	t.reverse()
	teams = 0
	curr = 0
	players = 0
	for i in range(n):
		players += 1
		curr = players * t[i]
		if curr >= x:
			teams += 1
			curr = 0
			players = 0
	print(teams)
T = inp()
dims = []
tests = []
for _ in range(T):
	dims.append(inlt())
	tests.append(inlt())
for i in range(T):
	solve(dims[i], tests[i])


n = int(input())
for _ in range(n):
	(n, x) = map(int, input().split(' '))
	a = list(map(int, input().split(' ')))
	a.sort(reverse=True)
	ans = 0
	cnt = 1
	for val in a:
		if val * cnt >= x:
			ans += 1
			cnt = 1
		else:
			cnt += 1
	print(ans)


t = int(input())
for i in range(t):
	(n, x) = [int(i) for i in input().split()]
	l = [int(i) for i in input().split()]
	l = sorted(l)
	arr = []
	for i in l:
		arr.append((x - 1) // i)
	arr.reverse()
	ans = 0
	index = 0
	for i in range(n):
		if arr[i] <= index:
			ans += 1
			index = 0
		else:
			index += 1
	print(ans)


def compute(N, limit, lineup):
	counter = lineup[N - 1]
	ans = 0
	multiplier = 1
	j = 1
	for i in range(N, 0, -1):
		if counter >= limit:
			ans += 1
			counter = lineup[N - 1 - j]
			multiplier = 1
		else:
			multiplier += 1
			counter = lineup[N - 1 - j] * multiplier
		j += 1
	return ans
for i in range(int(input())):
	(N, limit) = [int(x) for x in input().split()]
	lineup = sorted([int(x) for x in input().split()])
	print(compute(N, limit, lineup))


import math
for _ in range(int(input())):
	(n, x) = map(int, input().split())
	l1 = list(map(int, input().split()))
	l = []
	ans = 0
	for i in range(n):
		l.append(math.ceil(x / l1[i]))
	l.sort()
	c = 0
	i = 0
	while i < n:
		l[i] -= 1
		c += 1
		if l[i] == 0:
			ans += 1
			c = 0
		elif i < n - 1:
			l[i + 1] -= c
		i += 1
	print(ans)


for i in range(int(input())):
	(n, x) = map(int, input().split())
	l = list(map(int, input().split()))
	l.sort()
	count = 0
	j = 1
	while len(l) > 0:
		if l[-j] * j >= x:
			count += 1
			for _ in range(j):
				l.pop()
			j = 1
		elif j == len(l):
			break
		else:
			j += 1
	print(count)


import sys
import math
import collections
import operator as op
from collections import deque
from math import gcd, inf, sqrt, pi, cos, sin, ceil, log2
from bisect import bisect_right, bisect_left
from functools import reduce
from sys import stdin, stdout, setrecursionlimit
setrecursionlimit(2 ** 20)

def factorial(n):
	if n == 0:
		return 1
	return n * factorial(n - 1)

def ncr(n, r):
	r = min(r, n - r)
	numer = reduce(op.mul, range(n, n - r, -1), 1)
	denom = reduce(op.mul, range(1, r + 1), 1)
	return numer // denom

def prime_factors(n):
	i = 2
	factors = []
	while i * i <= n:
		if n % i:
			i += 1
		else:
			n //= i
			factors.append(i)
	if n > 1:
		factors.append(n)
	return len(set(factors))

def isPowerOfTwo(x):
	return x and (not x & x - 1)

def factors(n):
	return list(set(reduce(list.__add__, ([i, n // i] for i in range(1, int(n ** 0.5) + 1) if n % i == 0))))
MOD = 1000000007
PMOD = 998244353
T = 1
T = int(stdin.readline())
for _ in range(T):
	(n, x) = list(map(int, stdin.readline().rstrip().split()))
	a = list(map(int, stdin.readline().rstrip().split()))
	a.sort()
	i = n - 1
	ans = 0
	val = a[-1]
	t = 1
	while i >= 0:
		if val >= x:
			ans += 1
			i -= 1
			val = a[i]
			t = 1
		else:
			i -= 1
			t += 1
			val = t * a[i]
	print(ans)


import sys
input = sys.stdin.readline
for _ in range(int(input())):
	(n, x) = map(int, input().split())
	a = list(map(int, input().split()))
	a.sort()
	a = a[::-1]
	ans = 0
	c = 0
	for i in range(n):
		c += 1
		if c * a[i] >= x:
			ans += 1
			c = 0
	print(ans)


def tell(l, a, min_s):
	c = 0
	t = 0
	l.sort(reverse=True)
	for i in range(a):
		if l[i] * c >= min_s:
			t += 1
			c = 0
		else:
			c += 1
			if l[i] * c >= min_s:
				t += 1
				c = 0
	return t
number_o_v = int(input())
for i in range(number_o_v):
	(a, min_s) = list(map(int, input().split(' ')))
	l = list(map(int, input().split(' ')))
	s = tell(l, a, min_s)
	print(s)


s = int(input())
while s != 0:
	s -= 1
	(a, b) = list(map(int, input().split()))
	l = sorted(list(map(int, input().split())), reverse=True)
	(res, mul) = (0, 1)
	for x in l:
		if x * mul >= b:
			res += 1
			mul = 0
		mul += 1
	print(res)


n = int(input())
for _ in range(n):
	(a, b) = list(map(int, input().split()))
	arr = list(map(int, input().split()))
	arr.sort(reverse=True)
	index = 1
	ans = 0
	for i in range(a):
		if arr[i] * index < b:
			index += 1
		else:
			ans += 1
			index = 1
	print(ans)


def getArray():
	return [int(x) for x in input().split()]

def getInts():
	return map(int, input().split())
for _ in range(int(input())):
	(n, x) = getInts()
	a = getArray()
	a.sort(reverse=True)
	(cnt, ans) = (0, 0)
	for d in a:
		cnt += 1
		if d * cnt >= x:
			ans += 1
			cnt = 0
	print(ans)


from sys import stdin

def inp():
	return stdin.buffer.readline().rstrip().decode('utf8')

def itg():
	return int(stdin.buffer.readline())

def mpint():
	return map(int, stdin.buffer.readline().split())
from math import ceil
from bisect import bisect_left
for case in range(itg()):
	(n, x) = mpint()
	arr = list(mpint())
	arr.sort()
	ans = num = 0
	while arr and num <= len(arr):
		num += 1
		idx = bisect_left(arr, ceil(x / num))
		amount = len(arr) - idx
		q = amount // num
		ans += q
		idx = len(arr) - q * num
		if idx >= 0:
			del arr[idx:]
	print(ans)


import math
for _ in range(int(input())):
	(n, x) = list(map(int, input().split()))
	a = []
	for v in input().split():
		v = int(v)
		a.append(math.ceil(x / v))
	a.sort()
	c = 0
	p = 0
	for i in range(n):
		p += 1
		if a[i] <= p:
			c += 1
			p = 0
	print(c)


import math
t = int(input())
for i in range(t):
	(n, m) = [int(n) for n in input().split()]
	arr = list(map(int, input().strip().split()))
	arr.sort()
	l = 1
	j = n - 1
	count = 0
	while j >= 0:
		if arr[j] * l >= m:
			count = count + 1
			l = 1
			j = j - 1
		else:
			j = j - 1
			l = l + 1
	print(count)


for _ in range(int(input())):
	(n, x) = map(int, input().split())
	a = sorted(list(map(int, input().split())), reverse=True)
	(len, cnt) = (1, 0)
	for ele in a:
		if len * ele >= x:
			cnt += 1
			len = 0
		len += 1
	print(cnt)


import os, io
input = io.BytesIO(os.read(0, os.fstat(0).st_size)).readline
t = int(input())
for _ in range(t):
	(n, x) = map(int, input().split())
	a = list(map(int, input().split()))
	aInverse = []
	for elem in a:
		if x % elem == 0:
			aInverse.append(x // elem)
		else:
			aInverse.append(x // elem + 1)
	aInverseCount = [0] * n
	for elem in aInverse:
		if elem <= n:
			aInverseCount[elem - 1] += 1
	runningTally = 0
	group = 0
	for i in range(n):
		runningTally += aInverseCount[i]
		group += runningTally // (i + 1)
		runningTally %= i + 1
	print(group)


import sys
import io
import math
import collections
import decimal
import itertools
import bisect
import heapq

def input():
	return sys.stdin.readline()[:-1]
INF = 10 ** 10

def solve(N, X, A):
	A.sort()
	team = 0
	n = 0
	while A:
		a = A.pop()
		n += 1
		if n * a >= X:
			team += 1
			a = 0
			n = 0
	return team
T0 = int(input())
for _ in range(T0):
	(N, X) = map(int, input().split())
	A = list(map(int, input().split()))
	print(solve(N, X, A))


t = int(input())
for _ in range(t):
	(n, x) = map(int, input().split())
	k = sorted(list(map(int, input().split())), reverse=True)
	ans = 0
	c = 0
	m = 100000000000.0 + 1
	for i in k:
		c += 1
		m = min(m, i)
		if m * c >= x:
			ans += 1
			c = 0
			m = 100000000000.0 + 1
	print(ans)


t = int(input())
for _ in range(t):
	(n, x) = tuple(map(int, input().split()))
	l = list(map(int, input().split()))
	l.sort(reverse=True)
	index = 0
	ret_count = 0
	while index < n:
		count = 1
		while l[index] * count < x:
			if index == n - 1:
				ret_count -= 1
				break
			else:
				index += 1
				count += 1
		index += 1
		ret_count += 1
	print(ret_count)


import sys, math, cmath, time
start_time = time.time()

def solve():
	(n, x) = invr()
	a = inlt()
	a.sort(reverse=True)
	q = 0
	w = 0
	for i in range(len(a)):
		w = w + 1
		if a[i] * w >= x:
			q = q + 1
			w = 0
	print(q)

def main():
	global tt
	if not ONLINE_JUDGE:
		sys.stdin = open('input.txt', 'r')
		sys.stdout = open('output.txt', 'w')
	t = 1
	t = inp()
	for tt in range(t):
		solve()
	if not ONLINE_JUDGE:
		print('Time Elapsed :', time.time() - start_time, 'seconds')
		sys.stdout.close()

def inp():
	return int(input())

def inlt():
	return list(map(int, input().split()))

def insr():
	return input().strip()

def invr():
	return map(int, input().split())

def counter(a, qw):
	q = [0] * qw
	for i in range(len(a)):
		q[a[i] - 1] = q[a[i] - 1] + 1
	return q

def counter_elements(a):
	q = dict()
	for i in range(len(a)):
		if a[i] not in q:
			q[a[i]] = 0
		q[a[i]] = q[a[i]] + 1
	return q

def string_counter(a):
	q = [0] * 26
	for i in range(len(a)):
		q[ord(a[i]) - 97] = (q[ord(a[i]) - 97], 1)
	return q

def factors(n):
	q = []
	for i in range(1, int(n ** 0.5) + 1):
		if n % i == 0:
			q.append(i)
			q.append(n // i)
	return list(sorted(list(set(q))))

def prime_factors(n):
	q = []
	while n % 2 == 0:
		q.append(2)
		n = n // 2
	for i in range(3, int(n ** 0.5) + 1, 2):
		while n % i == 0:
			q.append(i)
			n = n // i
	if n > 2:
		q.append(n)
	return list(sorted(q))

def transpose(a):
	(n, m) = (len(a), len(a[0]))
	b = [[0] * n for i in range(m)]
	for i in range(m):
		for j in range(n):
			b[i][j] = a[j][i]
	return b
ONLINE_JUDGE = __debug__
if ONLINE_JUDGE:
	input = sys.stdin.readline
main()


def solve(a, n, x):
	a.sort(reverse=True)
	cnt = 0
	i = 0
	while i < n:
		flag = True
		if a[i] >= x:
			cnt += 1
		else:
			curr = 0
			mx = a[i]
			while i < n and curr * mx < x:
				flag = False
				curr += 1
				mx = min(a[i], mx)
				i += 1
			if curr * mx >= x:
				cnt += 1
		if flag:
			i += 1
	return cnt
t = int(input())
for _ in range(t):
	(n, x) = map(int, input().split())
	a = list(map(int, input().split()))
	print(solve(a, n, x))


import math
n = int(input())
for i in range(n):
	(a, b) = map(int, input().split())
	l = list(map(int, input().split()))
	l.sort(reverse=True)
	c = 0
	v = 0
	ind = 0
	if l[0] >= b:
		for j in range(a):
			if l[j] >= b:
				c += 1
			else:
				ind = j
				break
		else:
			ind = j
	if ind == a - 1:
		print(c)
	else:
		le = 0
		for j in range(ind, a):
			le += 1
			if le * l[j] >= b:
				c += 1
				le = 0
		print(c)


t = int(input())

def binary_search(arr, val, start, end):
	if start == end:
		if arr[start] > val:
			return start
		else:
			return start + 1
	if start > end:
		return start
	mid = (start + end) // 2
	if arr[mid] < val:
		return binary_search(arr, val, mid + 1, end)
	elif arr[mid] > val:
		return binary_search(arr, val, start, mid - 1)
	else:
		return mid
for i in range(t):
	(n, x) = map(int, input().split())
	inputarray = list(map(int, input().split()))
	inputarray = sorted(inputarray)
	teams = 0
	pos = binary_search(inputarray, x, 0, n - 1)
	i = pos
	j = 2
	teams += n - pos
	if pos == 0:
		print(teams)
	else:
		while i - j >= 0:
			if inputarray[i - j] * j >= x:
				teams += 1
				i = i - j
				j = 2
			else:
				j += 1
		print(teams)


t = int(input())
from collections import defaultdict
for _ in range(t):
	(n, k) = map(int, input().split())
	arr = list(map(int, input().strip().split()))[:n]
	arr.sort(reverse=True)
	team = 0
	count = 0
	for num in arr:
		count += 1
		if num * count >= k:
			team += 1
			count = 0
	print(team)


import bisect
import copy
import fractions
import heapq
import math
import random
import sys
T = int(input())
for t in range(T):
	(N, X) = tuple(map(int, input().split()))
	skills = list(map(int, input().split()))
	skills.sort()
	groups = 0
	(current_min, current_group_size) = (None, 0)
	while len(skills) > 0:
		current_min = skills.pop()
		current_group_size += 1
		if current_min * current_group_size >= X:
			current_group_size = 0
			current_min = None
			groups += 1
	print(groups)


I = input
import math
for _ in range(int(I())):
	(n, x) = map(int, I().split())
	a = list(map(int, I().split()))
	a.sort()
	a1 = []
	for i in a:
		a1.append(0 if i >= x else math.ceil(x / i))
	i = n - 1
	j = n - 1
	ans = 0
	while i >= 0:
		if a1[i] == 0:
			ans += 1
			i -= 1
			j -= 1
		elif j - i + 1 >= a1[i]:
			ans += 1
			i -= 1
			j = i
		else:
			i -= 1
	print(ans)


from sys import stdin
for _ in range(int(stdin.readline())):
	(n, x) = [int(i) for i in stdin.readline().split()]
	lst = [int(i) for i in stdin.readline().split()]
	lst.sort(reverse=True)
	i = 0
	nd = 0
	lst2 = []
	nk = 0
	while i < n:
		nk += 1
		if lst[i] * nk >= x:
			nd += 1
			nk = 0
		i += 1
	print(nd)


import math, string, itertools, fractions, heapq, collections, re, array, bisect, sys, copy, functools
inf = 10 ** 20
eps = 1.0 / 10 ** 10
mod = 10 ** 9 + 7
mod2 = 998244353
dd = [(-1, 0), (0, 1), (1, 0), (0, -1)]
ddn = [(-1, 0), (-1, 1), (0, 1), (1, 1), (1, 0), (1, -1), (0, -1), (-1, -1)]

def LI():
	return list(map(int, sys.stdin.readline().split()))

def LLI():
	return [list(map(int, l.split())) for l in sys.stdin.readlines()]

def LI_():
	return [int(x) - 1 for x in sys.stdin.readline().split()]

def LF():
	return [float(x) for x in sys.stdin.readline().split()]

def LS():
	return sys.stdin.readline().split()

def I():
	return int(sys.stdin.readline())

def F():
	return float(sys.stdin.readline())

def S():
	return input()

def pf(s):
	return print(s, flush=True)

def pe(s):
	return print(str(s), file=sys.stderr)

def JA(a, sep):
	return sep.join(map(str, a))

def JAA(a, s, t):
	return s.join((t.join(map(str, b)) for b in a))

def IF(c, t, f):
	return t if c else f

def YES(c):
	return IF(c, 'YES', 'NO')

def Yes(c):
	return IF(c, 'Yes', 'No')

def main():
	t = I()
	rr = []
	for _ in range(t):
		(n, x) = LI()
		a = LI()
		b = sorted([(x + c - 1) // c for c in a])
		r = 0
		t = 0
		for c in b:
			t += 1
			if t >= c:
				r += 1
				t = 0
		rr.append(r)
	return JA(rr, '\n')
print(main())


import sys
import math
input = lambda : sys.stdin.readline().strip()
t = int(input())
while t:
	t -= 1
	(n, x) = map(int, input().split())
	a = list(map(int, input().split()))
	a.sort()
	ans = 0
	cnt = 0
	for i in range(n - 1, -1, -1):
		cnt += 1
		if cnt * a[i] >= x:
			ans += 1
			cnt = 0
	print(ans)


for _ in range(int(input())):
	(n, x) = [*map(int, input().split())]
	a = [*map(int, input().split())]
	a.sort()
	count = 0
	se = 0
	a = a[::-1]
	b = []
	for i in a:
		if i >= x:
			count += 1
		else:
			b.append(i)
	while len(b) != 0:
		if len(b) == 0:
			print(count)
			break
		else:
			pointer1 = 0
			for i in range(pointer1, len(b)):
				ans = b[i]
				se += 1
				if ans * se >= x:
					se = 0
					pointer1 = i + 1
					count += 1
			print(count)
			break
	if len(b) == 0:
		print(count)


feed = int(input())
for _ in range(feed):
	(_, min) = list(map(int, input().split()))
	arr = sorted(list(map(int, input().split())), reverse=True)
	teams = 0
	mul = 1
	for x in arr:
		if x * mul >= min:
			teams += 1
			mul = 1
		else:
			mul += 1
	print(teams)


from sys import stdin, stdout

def dfs(idx, a, x, memo):
	if idx >= len(a):
		return 0
	if memo[idx] != -1:
		return memo[idx]
	r = x // a[idx]
	if x % a[idx] != 0:
		r += 1
	r1 = 0
	if idx + r - 1 < len(a):
		r1 = 1 + dfs(idx + r, a, x, memo)
	r2 = dfs(idx + 1, a, x, memo)
	memo[idx] = max(r1, r2)
	return memo[idx]

def create_the_teams2(n, x, a):
	a.sort()
	memo = [-1] * n
	return dfs(0, a, x, memo)

def create_the_teams(n, x, a):
	a.sort(reverse=True)
	res = 0
	cnt = 0
	for i in range(n):
		cnt += 1
		if a[i] * cnt >= x:
			res += 1
			cnt = 0
	return res
t = int(stdin.readline())
for i in range(t):
	(n, x) = map(int, stdin.readline().split())
	a = list(map(int, stdin.readline().split()))
	res = create_the_teams(n, x, a)
	stdout.write(str(res) + '\n')


for i in range(int(input())):
	(n, x) = map(int, input().split())
	ls = [int(a) for a in input().split()]
	ls.sort(reverse=True)
	ls.append(0)
	k = -1
	k1 = ls[0]
	ctr = 0
	for j in range(n):
		if ls[j] * (j - k) >= x:
			k = j
			k1 = ls[j + 1]
			ctr += 1
	print(ctr)


from sys import stdin
TT = int(stdin.readline())
for loop in range(TT):
	(n, x) = map(int, stdin.readline().split())
	a = list(map(int, stdin.readline().split()))
	a.sort()
	a.reverse()
	ans = 0
	num = 0
	for i in range(n):
		num += 1
		if num * a[i] >= x:
			ans += 1
			num = 0
	print(ans)


for i in range(int(input())):
	(n, x) = map(int, input().split())
	a = sorted(list(map(int, input().split())), reverse=True)
	t = 0
	y = 0
	while len(a) > 0 and y <= len(a) - 1:
		if a[y] * (y + 1) >= x:
			t += 1
			for b in range(y + 1):
				del a[0]
			y = 0
		else:
			y += 1
	print(t)


import math
for _ in range(int(input())):
	(n, x) = map(int, input().split())
	lst = list(map(int, input().split()))
	lst.sort()
	teams = 0
	i = n - 1
	rem = 0
	while i >= 0:
		need = math.ceil(x / lst[i]) - 1
		if need <= 0:
			teams += 1
		elif rem >= need:
			rem -= need
			teams += 1
		else:
			rem += 1
		i -= 1
	print(teams)


import math, sys, bisect, heapq
from collections import defaultdict, Counter, deque
from itertools import groupby, accumulate
input = iter(sys.stdin.buffer.read().decode().splitlines()).__next__
ilele = lambda : map(int, input().split())
alele = lambda : list(map(int, input().split()))

def Y(c):
	print(['NO', 'YES'][c])

def y(c):
	print(['no', 'yes'][c])

def Yy(c):
	print(['No', 'Yes'][c])
for _ in range(int(input())):
	(n, x) = ilele()
	A = alele()
	count = 0
	A.sort()
	while len(A) > 0 and A[-1] >= x:
		A.pop()
		count += 1
	mini = 10000000000.0
	c = 0
	while len(A) > 0:
		z = A.pop()
		c += 1
		mini = min(mini, z)
		if mini * c >= x:
			mini = 10000000000.0
			c = 0
			count += 1
	print(count)


for t in range(int(input())):
	(n, x) = map(int, input().split())
	a = []
	ans = 0
	for num in input().split():
		if int(num) >= x:
			ans += 1
		else:
			a.append(int(num))
	a.sort(reverse=True)
	nop = 1
	for z in range(len(a)):
		val = nop * a[z]
		if val >= x:
			ans += 1
			nop = 0
		nop += 1
	print(ans)


from math import *
for u in range(int(input())):
	(n, x) = map(int, input().split())
	l = list(map(int, input().split()))
	m = inf
	l.sort(reverse=True)
	s = 0
	c = 0
	ka = 0
	for i in range(n):
		if l[i] >= x:
			ka += 1
		else:
			c = c + 1
			m = min(m, l[i])
			if m * c >= x:
				ka += 1
				c = 0
				m = inf
	print(ka)


for _ in range(int(input())):
	(u, v) = (list(map(int, input().split())), list(map(int, input().split())))
	x = u[1]
	v.sort()
	ans = 0
	for i in reversed(v):
		if i >= x:
			ans += 1
			v.pop()
		else:
			break
	minsf = 10 ** 9 + 1
	cnt = 0
	for i in reversed(v):
		minsf = min(minsf, i)
		cnt += 1
		if minsf * cnt >= x:
			ans += 1
			minsf = 10 ** 9 + 1
			cnt = 0
	print(ans)


for _ in range(int(input())):
	(n, x) = map(int, input().split())
	a = [int(x) for x in input().split()]
	a.sort()
	fr = 1
	ans = 0
	for i in range(n - 1, -1, -1):
		if a[i] * fr >= x:
			ans += 1
			fr = 1
		else:
			fr += 1
	print(ans)


for _ in range(int(input())):
	(n, x) = map(int, input().split())
	l = [int(i) for i in input().split()][:n]
	l.sort()
	(cnt, temp) = (0, 1)
	for i in range(len(l) - 1, -1, -1):
		if l[i] * temp >= x:
			cnt += 1
			temp = 1
		else:
			temp += 1
	print(cnt)


import sys
input = sys.stdin.readline
t = int(input())
for ii in range(t):
	(n, x) = map(int, input().split())
	a = [int(i) for i in input().split() if i != '\n']
	a.sort()
	count = 1
	team = 0
	for i in range(n - 1, -1, -1):
		if count * a[i] >= x:
			team += 1
			count = 1
		else:
			count += 1
	print(team)


import math
cases = int(input())
for i in range(cases):
	(n, x) = [int(x) for x in input().split(' ')]
	numbers = [int(x) for x in input().split(' ')]
	numbers.sort(reverse=True)
	teams = 0
	curr_count = 1
	for j in range(n):
		if curr_count * numbers[j] >= x:
			teams += 1
			curr_count = 1
		else:
			curr_count += 1
	print(teams)


t = int(input())
i = 0
while i < t:
	(n, x) = map(int, input().split())
	arr = list(map(int, input().split()))
	arr.sort()
	n = n - 1
	count = 1
	ans = 0
	while n != -1:
		a = arr[n] * count
		if a >= x:
			ans = ans + 1
			count = 1
		else:
			count = count + 1
		n = n - 1
	print(ans)
	i = i + 1


t = int(input())
for a0 in range(t):
	l = [int(i) for i in input().split()]
	n = l[0]
	x = l[1]
	l1 = [int(i) for i in input().split()]
	l1.sort()
	l1.reverse()
	curr = 1
	a = 0
	for i in l1:
		if curr * i >= x:
			a += 1
			curr = 0
		curr += 1
	print(a)


T = int(input())
for t in range(0, T):
	array = []
	(n, x) = map(int, input().split())
	array = list(map(int, input().split()))
	array.sort(reverse=True)
	team = 0
	member = 0
	required = 0
	for i in range(0, n):
		member = member + 1
		if x % array[i] == 0:
			num = int(x / array[i]) - 1
		else:
			num = int(x / array[i])
		required = num + 1
		if member == required:
			team = team + 1
			member = 0
			required = 0
	print(team)


from collections import deque
for _ in range(int(input())):
	(n, x) = [int(i) for i in input().split()]
	a = deque(sorted([int(i) for i in input().split()])[::-1])
	ans = 0
	i = 1
	while a:
		if a[0] * i >= x:
			ans += 1
			i = 0
			continue
		i += 1
		a.popleft()
	print(ans)


import sys
INF = 10 ** 20
MOD = 10 ** 9 + 7
I = lambda : list(map(int, input().split()))
from math import gcd
from math import ceil
from collections import defaultdict as dd, Counter
from bisect import bisect_left as bl, bisect_right as br

def solve():
	(n, x) = I()
	a = sorted(I())
	ans = 0
	last = n - 1
	for i in range(n - 1, -1, -1):
		if a[i] * (last - i + 1) >= x:
			last = i - 1
			ans += 1
	print(ans)
(t,) = I()
while t:
	t -= 1
	solve()


import sys
input = sys.stdin.buffer.readline
from math import *
t = int(input())
while t:
	t -= 1
	(n, x) = map(int, input().split())
	arr = list(map(int, input().split()))
	arr.sort(reverse=True)
	count = 1
	ans = 0
	for i in range(n):
		if count * arr[i] >= x:
			ans += 1
			count = 1
		else:
			count += 1
	print(ans)


from collections import defaultdict as dc
import sys
import math
mod = 10 ** 9 + 7

def sinp():
	p = str(sys.stdin.readline())
	return p

def seive(n):
	p = [0] * (n + 1)
	for i in range(2, n):
		for j in range(2 * i, n + 1, i):
			p[i] = 1
	return p

def inp():
	p = int(sys.stdin.readline())
	return p

def line():
	p = list(map(int, sys.stdin.readline().split()))
	return p

def read_mat():
	n = inp()
	a = []
	for i in range(n):
		a.append(line())
	return a

def ind(a):
	return ord(a) - ord('A')

def digit(n):
	p = [int(i) for i in str(n)]
	return p

def check(s, k):
	for i in range(7):
		if s[i] != '?' and s[i] != k[i]:
			return 0
	return 1

def find_max(s, q, p):
	c = 0
	for i in range(len(s)):
		if p[s[i]] == q[i]:
			c += 1
	return c
t = inp()
for i in range(t):
	(n, x) = line()
	a = line()
	a.sort(reverse=True)
	ans = 0
	c = 1
	l = a[0]
	for i in range(1, n):
		if l * c >= x:
			ans += 1
			c = 1
		else:
			c += 1
		l = a[i]
	if l * c >= x:
		ans += 1
	print(ans)


from sys import stdin
from collections import deque
mod = 10 ** 9 + 7
import sys
import random
from queue import PriorityQueue
from collections import Counter as cc
from bisect import bisect_right
from bisect import bisect_left
from collections import defaultdict
from math import sqrt, factorial, gcd, log2, inf, ceil
import heapq
input = lambda : sys.stdin.readline().rstrip()
from sys import stdin, stdout
from heapq import heapify, heappush, heappop
from itertools import permutations
from math import factorial as f

def ncr(n, r, p):
	num = den = 1
	for i in range(r):
		num = num * (n - i) % p
		den = den * (i + 1) % p
	return num * pow(den, p - 2, p) % p
import sys
t = int(input())
for _ in range(t):
	(n, x) = map(int, input().split())
	l = list(map(int, input().split()))
	l.sort(reverse=True)
	ans = 0
	y = -1
	for i in range(n):
		z = ceil(x / l[i])
		z1 = i - (z - 1)
		if z1 > y:
			ans += 1
			y = i
	print(ans)


for _ in range(int(input())):
	(n, x) = map(int, input().split())
	arr = list(map(int, input().split()))
	arr.sort(reverse=True)
	cnt = 1
	ans = 0
	for i in range(n):
		if arr[i] * cnt >= x:
			ans += 1
			cnt = 1
		else:
			cnt += 1
	print(ans)


import sys
input = sys.stdin.readline
for _ in range(int(input())):
	(n, x) = map(int, input().split())
	L = list(map(int, input().split()))
	L.sort(reverse=True)
	ans = 0
	count = 0
	for i in range(n):
		if L[i] >= x:
			ans += 1
			continue
		count += 1
		if L[i] < x:
			if count * L[i] >= x:
				ans += 1
				count = 0
	print(ans)


import sys
input = sys.stdin.buffer.readline
t = int(input())
for _ in range(t):
	(n, x) = map(int, input().split())
	a = list(map(int, input().split()))
	a = sorted(a, reverse=True)
	ans = 0
	cnt = 0
	sum_ = 0
	for i in range(n):
		cnt += 1
		min_ = a[i]
		if min_ * cnt >= x:
			ans += 1
			cnt = 0
			min_ = 0
	print(ans)


for i in range(int(input())):
	(n, x) = map(int, input().split())
	l = sorted(map(int, input().split()))[::-1]
	k = 0
	p = 1
	for i in range(n):
		if l[i] * p >= x:
			k += 1
			p = 1
		else:
			p += 1
	print(k)


import sys
input = sys.stdin.readline
for _ in range(int(input())):
	(x, y) = map(int, input().split())
	(*li,) = map(int, input().split())
	li.sort(reverse=True)
	(cnt, ans) = (0, 0)
	for i in range(x):
		min1 = li[i]
		cnt += 1
		if min1 * cnt >= y:
			ans += 1
			cnt = 0
	print(ans)


import sys
reader = (s.rstrip() for s in sys.stdin)
input = reader.__next__
t = int(input())
for _ in range(t):
	(n, X) = map(int, input().split())
	arr = list(map(int, input().split()))
	arr.sort()
	mn = int(10000000000.0)
	size = 0
	teams = 0
	while len(arr):
		last = arr.pop()
		size += 1
		mn = min(mn, last)
		if size * mn >= X:
			teams += 1
			mn = int(10000000000.0)
			size = 0
	print(teams)


for testcase in range(int(input())):
	(n, x) = map(int, input().split())
	a = list(sorted((int(i) for i in input().split())))
	dp = [0] * (n + 2)
	for i in range(1, n + 1):
		dp[i] = max(dp[i], dp[i - 1])
		required = (x + a[i - 1] - 1) // a[i - 1]
		if i + required <= n + 1:
			dp[i + required] = max(dp[i + required], dp[i] + 1)
	dp[n + 1] = max(dp[n], dp[n + 1])
	print(dp[n + 1])


def pro(arr, x):
	arr.sort(reverse=True)
	n = len(arr)
	c = 1
	ans = 0
	mini = arr[0]
	for i in range(n):
		if c * arr[i] >= x:
			ans += 1
			c = 1
		else:
			c += 1
	print(ans)
t = int(input())
for i in range(t):
	(n, k) = list(map(int, input().split()))
	arr = list(map(int, input().split()))
	pro(arr, k)


for _ in range(int(input())):
	(m, n) = map(int, input().split())
	c = 0
	d = 0
	l = [int(p) for p in input().split()]
	l.sort(reverse=True)
	for i in range(m):
		if l[i] >= n:
			c += 1
			continue
		else:
			d += 1
			if l[i] * d >= n:
				c += 1
				d = 0
	print(c)


import sys
from collections import Counter

def solve(a, x):
	a.sort(reverse=True)
	n = len(a)
	min_size = [0] * n
	for i in range(n):
		min_size[i] = x // a[i] if x % a[i] == 0 else x // a[i] + 1
	unpaired = 0
	nteams = 0
	for v in min_size:
		if unpaired + 1 == v:
			nteams += 1
			unpaired = 0
		else:
			unpaired += 1
	return nteams
IN = [x.strip() for x in sys.stdin.readlines()]
T = int(IN[0])
cur = 1
for ti in range(T):
	(n, x) = [int(x) for x in IN[cur].split(' ')]
	a = [int(x) for x in IN[cur + 1].split(' ')]
	result = solve(a, x)
	print(result)
	cur += 2


import sys
input = sys.stdin.readline

def teams(arr, n, x):
	arr.sort(reverse=True)
	count = 0
	from collections import deque
	q = deque(arr)
	while len(q) > 0:
		popped = q.popleft()
		if popped < x:
			container = [popped]
			if len(q) > 0:
				while len(container) * container[-1] < x:
					if len(q) > 0:
						container.append(q.popleft())
						if len(container) * container[-1] >= x:
							count += 1
					else:
						break
		else:
			count += 1
	return count

def solution():
	l = list(map(lambda x: int(x), input().split()))
	n = l[0]
	x = l[1]
	arr = list(map(lambda x: int(x), input().split()))
	print(teams(arr, n, x))
t = int(input())
for i in range(0, t):
	solution()


for _ in range(int(input())):
	(n, x) = map(int, input().split())
	skill = sorted(list(map(int, input().split())))
	(teams, i, size) = (0, n - 1, 0)
	while i > -1:
		size += 1
		if skill[i] * size >= x:
			teams += 1
			size = 0
		i -= 1
	print(teams)


for _ in range(int(input())):
	(n, x) = map(int, input().split())
	l = list(map(int, input().split()))
	l.sort()
	l.reverse()
	ans = 0
	idx = 0
	lenx = 1
	while idx < n:
		if l[idx] * lenx >= x:
			ans += 1
			lenx = 1
			idx += 1
		else:
			lenx += 1
			idx += 1
	print(ans)


production = True
import sys, math, collections

def input(input_format=0, multi=0):
	if multi > 0:
		return [input(input_format) for i in range(multi)]
	else:
		next_line = sys.stdin.readline()[:-1]
		if input_format >= 10:
			use_list = False
			input_format = int(str(input_format)[-1])
		else:
			use_list = True
		if input_format == 0:
			formatted_input = [next_line]
		elif input_format == 1:
			formatted_input = list(map(int, next_line.split()))
		elif input_format == 2:
			formatted_input = list(map(float, next_line.split()))
		elif input_format == 3:
			formatted_input = list(next_line)
		elif input_format == 4:
			formatted_input = list(map(int, list(next_line)))
		elif input_format == 5:
			formatted_input = next_line.split()
		else:
			formatted_input = [next_line]
		return formatted_input if use_list else formatted_input[0]

def out(output_line, output_format=0, newline=True):
	formatted_output = ''
	if output_format == 0:
		formatted_output = str(output_line)
	elif output_format == 1:
		formatted_output = ' '.join(map(str, output_line))
	elif output_format == 2:
		formatted_output = '\n'.join(map(str, output_line))
	print(formatted_output, end='\n' if newline else '')

def log(*args):
	if not production:
		print('$$$', end='')
		print(*args)
enu = enumerate
ter = lambda a, b, c: b if a else c
ceil = lambda a, b: -(-a // b)

def mapl(iterable, format=0):
	if format == 0:
		return list(map(int, iterable))
	elif format == 1:
		return list(map(str, iterable))
	elif format == 2:
		return list(map(list, iterable))

def solve():
	(n, x) = input(1)
	a = input(1)
	a.sort()
	b = [ceil(x, i) for i in a]
	t = 0
	while b:
		q = b.pop()
		f = 1
		log(t, q, f, b)
		while q > f and b:
			q = b.pop()
			f += 1
		if f == q:
			t += 1
	out(t)
	return
for i in range(input(11)):
	solve()


t = int(input())
for i in range(t):
	(n, x) = map(int, input().split())
	data = list(map(int, input().split()))
	data = sorted(data, reverse=True)
	count = 1
	ans = 0
	for j in range(n):
		if data[j] * count >= x:
			ans += 1
			count = 1
		else:
			count += 1
	print(ans)


import math
for j in range(int(input())):
	(n, x) = map(int, input().split())
	l = list(map(int, input().split()))
	p = 0
	z = 0
	k = 0
	t = []
	for i in range(n):
		if l[i] >= x:
			p += 1
		elif l[i] >= math.ceil(x / 2):
			z += 1
			if z == 2:
				z = 0
				k += 1
		else:
			t.append(l[i])
	t.sort()
	m = 0
	y = z
	for i in range(len(t) - 1, -1, -1):
		u = t[i] * (y + 1)
		y += 1
		if u >= x:
			m += 1
			y = 0
	print(m + k + p)


def solve(skills, X):
	skills.sort(reverse=True)
	ans = 0
	w_min = float('inf')
	w_count = 0
	for x in skills:
		w_min = x
		w_count += 1
		if w_min * w_count >= X:
			ans += 1
			w_min = float('inf')
			w_count = 0
	return ans

def main():
	T = int(input())
	for _ in range(T):
		(_, X) = list(map(int, input().split()))
		A = list(map(int, input().split()))
		ans = solve(A, X)
		print(ans)
main()


cases = int(input())
for i in range(cases):
	l1 = input().split(' ')
	l2 = input().split(' ')
	n = int(l1[0])
	x = int(l1[1])
	arr = []
	for a in l2:
		arr.append(int(a))
	arr.sort(reverse=True)
	g = 0
	current = 0
	ini = 0
	endpoint = 0
	while ini < len(arr):
		current = arr[ini]
		if current >= x:
			g += 1
			endpoint = ini + 1
		elif current < x:
			check = current * (ini - endpoint + 1)
			if check >= x:
				g += 1
				endpoint = ini + 1
		ini += 1
	print(g)


from sys import stdin, stdout
import math, sys
from itertools import permutations, combinations
from collections import defaultdict, deque, OrderedDict
from os import path
import bisect as bi
import heapq

def yes():
	print('YES')

def no():
	print('NO')
if path.exists('input.txt'):
	sys.stdin = open('input.txt', 'r')
	sys.stdout = open('output.txt', 'w')

	def I():
		return int(input())

	def In():
		return list(map(int, input().split()))
else:

	def I():
		return int(stdin.readline())

	def In():
		return list(map(int, stdin.readline().split()))

def dict(a):
	d = {}
	for x in a:
		if d.get(x, -1) != -1:
			d[x] += 1
		else:
			d[x] = 1
	return d

def main():
	try:
		(n, X) = In()
		l = list(In())
		l.sort(reverse=True)
		mi = -1
		(j, ans) = (0, 0)
		for x in range(n):
			if mi == -1:
				mi = l[x]
				j = 1
			else:
				mi = min(mi, l[x])
				j += 1
			if mi * j >= X:
				ans += 1
				mi = -1
				j = 0
		print(ans)
	except:
		pass
M = 998244353
P = 1000000007

def __starting_point():
	for _ in range(I()):
		main()
__starting_point()


for _ in range(int(input())):
	(a, x) = [int(a) for a in input().split(' ')]
	arr = [int(a) for a in input().split(' ')]
	arr = sorted(arr, reverse=True)
	cur_skill = x
	teams = 0
	cur_len = 0
	for i in arr:
		if i >= x:
			teams += 1
			continue
		else:
			cur_skill = i
			cur_len += 1
			if cur_len * cur_skill >= x:
				teams += 1
				cur_len = 0
				cur_skill = x
	print(teams)


for _ in range(int(input())):
	a = input().split()
	n = int(a[0])
	x = int(a[1])
	A = list(map(int, input().split()))
	A.sort(reverse=True)
	lastmin = A[0]
	c = 0
	lasti = 0
	for i in range(1, n + 1):
		lastmin = min(lastmin, A[i - 1])
		if (i - lasti) * lastmin >= x:
			c += 1
			lasti = i
			lastmin = 10 ** 10
	print(c)


from sys import stdin
input = stdin.readline

def solve():
	(_, x) = map(int, input().split())
	a = list(map(int, input().split()))
	a.sort(reverse=True)
	ans = 0
	cnt = 0
	for i in a:
		k = (x + i - 1) // i
		if cnt + 1 >= k:
			cnt -= k - 1
			ans += 1
		else:
			cnt += 1
	print(ans)

def main():
	t = int(input())
	for _ in range(t):
		solve()
main()


abc = int(input())
for x in range(abc):
	s = input().split(' ')[1]
	t = input().split(' ')
	s = int(s)
	t = [int(y) for y in t]
	t.sort()
	t = t[::-1]
	pointer = 0
	teams = 0
	groups = 1
	while pointer < len(t):
		count = 0
		Opointer = pointer
		while True:
			if t[pointer] >= s / groups:
				count += 1
				pointer += 1
			else:
				groups += 1
				count = 0
				pointer = Opointer
				if groups > len(t) - pointer:
					break
				continue
			if count == groups:
				teams += 1
				break
		if groups > len(t) - pointer:
			break
		pointer = Opointer + count
	print(teams)


import sys
import string
from collections import Counter, defaultdict
from math import fsum, sqrt, gcd, ceil, factorial
from itertools import combinations, permutations
flush = lambda : sys.stdout.flush
comb = lambda x, y: factorial(x) // factorial(y) // factorial(x - y)
ip = lambda : input()
ii = lambda : int(input())
r = lambda : map(int, input().split())
rr = lambda : list(r())

def solve():
	(n, k) = r()
	arr = rr()
	arr.sort()
	ans = [0] * n
	i = n - 1
	while i > -1:
		need = (k + arr[i] - 1) // arr[i]
		if n - i >= need:
			ans[i] = 1
		if i + need < n:
			ans[i] += ans[i + need]
		i -= 1
	print(max(ans))
for _ in range(ii()):
	solve()


for cases in range(int(input())):
	(n, x) = map(int, input().split())
	p = list(map(int, input().split()))
	p.sort()
	p.reverse()
	flag = 0
	setter = 0
	for i in range(0, len(p)):
		if p[i] * (i + 1 - setter) >= x:
			flag += 1
			setter = i + 1
	print(flag)


def solve():
	t = int(input())
	for _ in range(t):
		(n, x) = map(int, input().split())
		S = [int(y) for y in input().split()]
		S.sort(reverse=True)
		(team, cnt) = (0, 0)
		for s in S:
			cnt += 1
			if s * cnt >= x:
				team += 1
				cnt = 0
		print(team)
solve()


def f(n, m):
	if n % m == 0:
		return n // m
	else:
		return n // m + 1
t = int(input())
while t > 0:
	t = t - 1
	(n, x) = map(int, input().split())
	a = input()
	A = list(map(int, list(a.split())))
	A.sort()
	dp = [0] * n
	if f(x, A[n - 1]) <= 1:
		dp[n - 1] = 1
	for i in range(n - 2, -1, -1):
		y = f(x, A[i])
		if y < n - i:
			dp[i] = 1 + dp[i + y]
		elif y == n - i:
			dp[i] = 1
	print(max(dp))


for _ in range(int(input())):
	(n, x) = map(int, input().split())
	arr = list(map(int, input().split()))
	arr.sort(reverse=True)
	teams = 0
	i = 0
	while i < n:
		p = i
		while i < n and (i + 1 - p) * arr[i] < x:
			i += 1
		if i == n:
			break
		else:
			teams += 1
			i += 1
	print(teams)


t = int(input())
for q in range(t):
	(n, m) = map(int, input().split(' '))
	li = list(map(int, input().split(' ', n)[:n]))
	li.sort()
	ans = 0
	cs = 0
	k = 1
	for i in range(n - 1, -1, -1):
		cs = li[i] * k
		if cs >= m:
			ans += 1
			cs = 0
			k = 1
		else:
			k += 1
	print(ans)


for _ in range(int(input())):
	(n, x) = map(int, input().split())
	lis = sorted(map(int, input().split()), reverse=True)
	ans = cur = mi = no = 0
	for i in range(n):
		if cur == 0:
			no = 1
			cur = 1
		else:
			no += 1
		mi = lis[i]
		if mi * no >= x:
			ans += 1
			no = 0
			cur = 0
	print(ans)


import math
import itertools
import operator
from itertools import combinations
t = int(input())
for _ in range(t):
	(n, x) = map(int, input().split())
	li = list(map(int, input().split()))
	li.sort()
	c = 0
	tmp = 0
	for i in range(n - 1, -1, -1):
		tmp += 1
		if li[i] * tmp >= x:
			c += 1
			tmp = 0
	print(c)


for i in range(int(input())):
	(n, x) = map(int, input().split())
	a = list(map(int, input().split()))
	a.sort()
	z = 0
	ans = 0
	for i in range(n - 1, -1, -1):
		z += 1
		if a[i] * z >= x:
			z = 0
			ans += 1
	print(ans)


for _ in range(int(input())):
	(n, k) = map(int, input().split())
	a = list(map(int, input().split()))
	a.sort(reverse=True)
	ans = 0
	i = 0
	l = 0
	while i < n:
		l += 1
		if a[i] * l >= k:
			ans += 1
			l = 0
		i += 1
	print(ans)


for _ in range(int(input())):
	(n, x) = map(int, input().split())
	a = [*map(int, input().split())]
	a.sort(reverse=True)
	ans = team_size_rn = 0
	min_rn = 1000000000.0
	for i in a:
		min_rn = min(min_rn, i)
		team_size_rn += 1
		if team_size_rn * min_rn >= x:
			ans += 1
			team_size_rn = 0
			min_rn = 1000000000.0
	print(ans)


for _ in ' ' * int(input()):
	(a, b) = map(int, input().split())
	z = sorted(map(int, input().split()))[::-1]
	s = c = i = 0
	while i < a:
		c += 1
		if c * z[i] >= b:
			s += 1
			c = 0
		i += 1
	print(s)


import os
import sys
from io import BytesIO, IOBase

def main():
	pass
BUFSIZE = 8192

class FastIO(IOBase):
	newlines = 0

	def __init__(self, file):
		self._fd = file.fileno()
		self.buffer = BytesIO()
		self.writable = 'x' in file.mode or 'r' not in file.mode
		self.write = self.buffer.write if self.writable else None

	def read(self):
		while True:
			b = os.read(self._fd, max(os.fstat(self._fd).st_size, BUFSIZE))
			if not b:
				break
			ptr = self.buffer.tell()
			(self.buffer.seek(0, 2), self.buffer.write(b), self.buffer.seek(ptr))
		self.newlines = 0
		return self.buffer.read()

	def readline(self):
		while self.newlines == 0:
			b = os.read(self._fd, max(os.fstat(self._fd).st_size, BUFSIZE))
			self.newlines = b.count(b'\n') + (not b)
			ptr = self.buffer.tell()
			(self.buffer.seek(0, 2), self.buffer.write(b), self.buffer.seek(ptr))
		self.newlines -= 1
		return self.buffer.readline()

	def flush(self):
		if self.writable:
			os.write(self._fd, self.buffer.getvalue())
			(self.buffer.truncate(0), self.buffer.seek(0))

class IOWrapper(IOBase):

	def __init__(self, file):
		self.buffer = FastIO(file)
		self.flush = self.buffer.flush
		self.writable = self.buffer.writable
		self.write = lambda s: self.buffer.write(s.encode('ascii'))
		self.read = lambda : self.buffer.read().decode('ascii')
		self.readline = lambda : self.buffer.readline().decode('ascii')
(sys.stdin, sys.stdout) = (IOWrapper(sys.stdin), IOWrapper(sys.stdout))
input = lambda : sys.stdin.readline().rstrip('\r\n')

def count1(s):
	c = 0
	for i in s:
		if i == '1':
			c += 1
	return c

def binary(n):
	return bin(n).replace('0b', '')

def decimal(s):
	return int(s, 2)

def pow2(n):
	p = 0
	while n > 1:
		n //= 2
		p += 1
	return p

def isPrime(n):
	if n == 1:
		return False
	else:
		root = int(n ** 0.5)
		root += 1
		for i in range(2, root):
			if n % i == 0:
				return False
		return True
for xyz in range(0, int(input())):
	(n, x) = map(int, input().split())
	l = list(map(int, input().split()))
	l.sort(reverse=True)
	i = 0
	cnp = 0
	a = 0
	while i < n:
		if l[i] >= x:
			a += 1
		else:
			cnp += 1
			if l[i] * cnp >= x:
				cnp = 0
				a += 1
		i += 1
	print(a)


def solve():
	(n, x) = map(int, input().split(' '))
	a = list(map(int, input().split(' ')))
	a = sorted(a)
	a = a[::-1]
	i = 0
	t = 1
	num = 0
	while i < n:
		while t * a[i] < x:
			i += 1
			t += 1
			if i == n:
				break
		if i == n:
			break
		if a[i] * t >= x:
			num += 1
			t = 1
			i += 1
	print(num)
t = int(input())
while t:
	t -= 1
	solve()


import math, sys
from sys import stdin, stdout
from collections import Counter, defaultdict, deque
input = stdin.readline
I = lambda : int(input())
li = lambda : list(map(int, input().split()))

def solve():
	(n, k) = li()
	a = li()
	flag = 0
	ans = 0
	c = 0
	s = 0
	a.sort(reverse=True)
	for i in range(n):
		if flag:
			c += 1
			s = a[i]
		else:
			s = a[i]
			c = 1
			flag = 1
		if s * c >= k:
			ans += 1
			flag = 0
			c = 0
	print(ans)
for _ in range(I()):
	solve()


t = int(input())
for _ in range(t):
	l = list(map(int, input().split()))
	(n, x) = (l[0], l[1])
	l = list(map(int, input().split()))
	l.sort(reverse=True)
	count = 0
	key = 0
	val = 0
	for i in range(n):
		val += l[i]
		count += 1
		if count * l[i] >= x:
			val = 0
			count = 0
			key += 1
	print(key)


for _ in range(int(input())):
	(n, x) = map(int, input().split())
	a = list(map(int, input().split()))
	tc = 0
	a.sort(reverse=True)
	mi = 1000000000
	i = 0
	fg = 0
	ct = 0
	while i < n:
		if a[i] >= x:
			tc += 1
		elif a[i] < x:
			if fg == 0:
				ct = 1
				mi = a[i]
				fg = 1
			elif fg == 1:
				ct += 1
				mi = min(mi, a[i])
				if ct * mi >= x:
					fg = 0
					tc += 1
					ct = 0
		i += 1
	print(tc)


for _ in range(int(input())):
	(n, x) = map(int, input().split())
	l = sorted(list(map(int, input().split())))
	i = n - 1
	ans = 0
	while i > -1:
		m = l[i]
		j = 1
		while i > -1 and l[i] * j < x:
			i -= 1
			j += 1
		if i != -1:
			ans += 1
		i -= 1
	print(ans)


from collections import deque
import os
import sys
from io import BytesIO, IOBase
BUFSIZE = 8192

class FastIO(IOBase):
	newlines = 0

	def __init__(self, file):
		self._fd = file.fileno()
		self.buffer = BytesIO()
		self.writable = 'x' in file.mode or 'r' not in file.mode
		self.write = self.buffer.write if self.writable else None

	def read(self):
		while True:
			b = os.read(self._fd, max(os.fstat(self._fd).st_size, BUFSIZE))
			if not b:
				break
			ptr = self.buffer.tell()
			(self.buffer.seek(0, 2), self.buffer.write(b), self.buffer.seek(ptr))
		self.newlines = 0
		return self.buffer.read()

	def readline(self):
		while self.newlines == 0:
			b = os.read(self._fd, max(os.fstat(self._fd).st_size, BUFSIZE))
			self.newlines = b.count(b'\n') + (not b)
			ptr = self.buffer.tell()
			(self.buffer.seek(0, 2), self.buffer.write(b), self.buffer.seek(ptr))
		self.newlines -= 1
		return self.buffer.readline()

	def flush(self):
		if self.writable:
			os.write(self._fd, self.buffer.getvalue())
			(self.buffer.truncate(0), self.buffer.seek(0))

class IOWrapper(IOBase):

	def __init__(self, file):
		self.buffer = FastIO(file)
		self.flush = self.buffer.flush
		self.writable = self.buffer.writable
		self.write = lambda s: self.buffer.write(s.encode('ascii'))
		self.read = lambda : self.buffer.read().decode('ascii')
		self.readline = lambda : self.buffer.readline().decode('ascii')
(sys.stdin, sys.stdout) = (IOWrapper(sys.stdin), IOWrapper(sys.stdout))
input = lambda : sys.stdin.readline().rstrip('\r\n')

def main():
	for t in range(int(input())):
		(n, x) = [int(j) for j in input().split()]
		l = [int(j) for j in input().split()]
		l.sort()
		cur = 0
		ans = 0
		for i in range(n - 1, -1, -1):
			if (cur + 1) * l[i] >= x:
				cur = 0
				ans += 1
			else:
				cur += 1
		print(ans)
main()


t = int(input())
while t > 0:
	t -= 1
	(n, x) = input().split()
	(n, x) = (int(n), int(x))
	ar = [int(op) for op in input().split()]
	ar = list(reversed(sorted(ar)))
	k = 0
	ln = 1
	for i in range(len(ar)):
		if ar[i] * ln >= x:
			k += 1
			ln = 1
		else:
			ln += 1
	print(k)


for _ in range(int(input())):
	(n, x) = map(int, input().split())
	a = list(map(int, input().split()))
	a.sort(reverse=True)
	s = 1
	c = 0
	for i in range(n):
		if a[i] * s >= x:
			c += 1
			s = 0
		s += 1
	print(c)


test_cases = int(input())
for _ in range(test_cases):
	(n, x) = [int(i) for i in input().split()]
	skills = sorted([int(i) for i in input().split()], reverse=True)
	pos = 0
	count = 0
	cur_n = 0
	while pos < len(skills):
		cur_n += 1
		if cur_n * skills[pos] >= x:
			count += 1
			cur_n = 0
		pos += 1
	print(count)


from math import ceil
for _ in range(int(input())):
	(n, x) = map(int, input().split())
	p = list(map(int, input().split()))
	if n == 1:
		if p[0] >= x:
			print(1)
		else:
			print(0)
		continue
	p.sort(reverse=True)
	t = 0
	(c, i) = (0, 0)
	while i < n:
		if p[i] >= x:
			t += 1
			i += 1
		else:
			y = ceil(x / p[i])
			if c + 1 >= y:
				t += 1
				c = 0
				i += 1
			else:
				i += 1
				c += 1
	print(t)


from bisect import bisect_left
import math
for tc in range(int(input())):
	(n, x) = map(int, input().split())
	arr = list(map(int, input().split()))
	arr.sort()
	ans = 0
	total_taken = 0
	remain = n
	for i in range(1, 100005):
		tmp = math.ceil(x / i)
		j = bisect_left(arr, tmp)
		rangee = n - j - total_taken
		ans += math.floor(rangee / i)
		remain -= math.floor(rangee / i) * i
		total_taken = n - remain
		if remain < i + 1:
			break
	print(ans)


from math import ceil
t = int(input())
for _ in range(t):
	(n, x) = [int(x) for x in input().split()]
	a = [int(x) for x in input().split()]
	a.sort()
	groups = 0
	dp = [0] * n
	if n == 1:
		print(0 if a[-1] < x else 1)
		continue
	if a[-1] >= x:
		dp[-1] = 1
	i = n - 2
	while i >= 0:
		req_size = ceil(x / a[i])
		if req_size + i > n:
			dp[i] = dp[i + 1]
		else:
			if req_size + i == n:
				groups = 1
			else:
				groups = dp[i + req_size] + 1
			dp[i] = max(groups, dp[i + 1])
		i -= 1
	print(dp[0])


t = int(input())
for s in range(t):
	(n, m) = map(int, input().split())
	array = list(map(int, input().split()))
	array.sort()
	array = array[::-1]
	add = 0
	j = 1
	for i in range(n):
		if array[i] * j >= m:
			add += 1
			j = 0
		j += 1
	print(add)


t = int(input())
for i in range(t):
	(n, x) = map(int, input().split())
	programmers = [int(a) for a in input().split()]
	programmers.sort(reverse=True)
	teams_counter = 0
	aux_counter = 1
	for j in range(n):
		if aux_counter * programmers[j] >= x:
			teams_counter += 1
			aux_counter = 1
		else:
			aux_counter += 1
	print(teams_counter)


for _ in range(int(input())):

	def main():
		(n, x) = list(map(int, input().split()))
		s = sorted(list(map(int, input().split())), reverse=True)
		(ans, cur) = (0, 1)
		for i in s:
			if i * cur >= x:
				ans += 1
				cur = 0
			cur += 1
		print(ans)
	main()


import sys
input = sys.stdin.readline
for _ in range(int(input())):
	(n, x) = map(int, input().split())
	ar = list(map(int, input().split()))
	ar.sort(reverse=True)
	ans = 0
	left = 0
	for i in range(n):
		if ar[i] * (left + 1) >= x:
			ans += 1
			left = 0
		else:
			left += 1
	print(ans)


t = int(input())
for _ in range(t):
	(n, x) = map(int, input().split())
	a = sorted(list(map(int, input().split())))
	a.reverse()
	(i, cur, ans) = (0, 0, 0)
	while i < n:
		if a[i] * (cur + 1) >= x:
			ans += 1
			cur = 0
		else:
			cur += 1
		i += 1
	print(ans)


from sys import stdin, stdout
for i in range(int(stdin.readline())):
	(n, x) = map(int, stdin.readline().split())
	a = [int(num) for num in stdin.readline().split()]
	(ans, temp) = (0, 1)
	(a.sort(), a.reverse())
	for i in range(n):
		if a[i] * temp >= x:
			ans += 1
			temp = 0
		temp += 1
	stdout.write(str(ans) + '\n')


from sys import stdin, stdout
import heapq
import cProfile
from collections import Counter, defaultdict, deque
from functools import reduce
import math

def get_int():
	return int(stdin.readline().strip())

def get_tuple():
	return map(int, stdin.readline().split())

def get_list():
	return list(map(int, stdin.readline().split()))

def solve():
	(n, x) = get_tuple()
	ls = get_list()
	ls.sort(reverse=True)
	ans = 0
	grp_size = 0
	mini = float('inf')
	for val in ls:
		mini = min(mini, val)
		grp_size += 1
		if grp_size * mini >= x:
			ans += 1
			grp_size = 0
			mini = float('inf')
	print(ans)

def main():
	solve()
TestCases = True
if TestCases:
	for i in range(get_int()):
		main()
else:
	main()


from collections import deque
from collections import OrderedDict
import math
import sys
import os
import threading
import bisect
import operator
import heapq
from atexit import register
from io import BytesIO
import io
input = lambda : sys.stdin.readline().rstrip('\r\n')
for t in range(int(input())):
	(n, x) = map(int, input().split())
	ar = list(map(int, input().split()))
	ar.sort()
	dp = [0] * (n + 1)
	answer = 0
	curT = 1
	for i in range(n):
		if ar[i] >= x:
			answer += 1
			continue
		if dp[i] == curT:
			answer += 1
			curT += 1
			continue
		val = x // ar[i] + (1 if x % ar[i] != 0 else 0)
		if i + val - 1 >= n:
			continue
		dp[i + val - 1] = curT
	print(answer)


t = int(input())
for tt in range(t):
	(n, d) = input().split()
	n = int(n)
	d = int(d)
	x = input()
	a = x.split()
	for r in range(len(a)):
		a[r] = int(a[r])
	a.sort(reverse=True)
	i = 1
	s = 0
	for j in range(0, len(a)):
		if a[j] * i >= d:
			s = s + 1
			i = 1
		else:
			i = i + 1
	print(s)


import sys
import math
from math import *
import builtins
import collections
import bisect
import os
from io import BytesIO, IOBase
from itertools import permutations
import string

def print(x, end='\n'):
	sys.stdout.write(str(x) + end)

def get_int():
	return int(input())

def get_list_ints():
	return list(map(int, input().split()))

def get_list_float():
	return list(map(float, input().split()))

def get_char_list():
	s = input()
	return list(s[:len(s)])

def get_tuple_ints():
	return tuple(map(int, input().split()))

def print_iterable(p):
	print(' '.join(map(str, p)))

def CountFrequency(arr):
	return collections.Counter(arr)

def reverse(s):
	l = len(s)
	for i in range(l // 2):
		(s[i], s[l - i - 1]) = (s[l - i - 1], s[i])
	return s

def binary_search(arr, x):
	low = 0
	high = len(arr) - 1
	mid = 0
	while low <= high:
		mid = (high + low) // 2
		if arr[mid] < x:
			low = mid + 1
		elif arr[mid] > x:
			high = mid - 1
		else:
			return mid
	return high

def lower_bound(arr, x):
	return bisect.bisect_left(arr, x, lo=0, hi=len(arr))

def upper_bound(arr, x):
	return bisect.bisect_right(arr, x, lo=0, hi=len(arr))

def position(x):
	return ord(x) - ord('a') + 1

def pow(a, n):
	if n == 0:
		return 1
	elif n % 2 == 0:
		return pow(a, n // 2) % const * (pow(a, n // 2) % const) % const
	else:
		return pow(a, n // 2) % const * (pow(a, n // 2) % const) * (a % const) % const

def main():
	t = get_int()
	for i in range(t):
		[n, x] = get_list_ints()
		list = get_list_ints()
		list.sort()
		alist = []
		for i in list:
			alist.append(math.ceil(x / i))
		anslist = [0 for i in range(n)]
		if alist[-1] == 1:
			anslist[-1] = 1
		anslist.append(0)
		for j in range(n - 2, -1, -1):
			if n - j < alist[j]:
				anslist[j] = 0
			else:
				anslist[j] = 1 + anslist[j + alist[j]]
		print(max(anslist))
	pass
BUFSIZE = 8192

class FastIO(IOBase):
	newlines = 0

	def __init__(self, file):
		self._fd = file.fileno()
		self.buffer = BytesIO()
		self.writable = 'x' in file.mode or 'r' not in file.mode
		self.write = self.buffer.write if self.writable else None

	def read(self):
		while True:
			b = os.read(self._fd, max(os.fstat(self._fd).st_size, BUFSIZE))
			if not b:
				break
			ptr = self.buffer.tell()
			(self.buffer.seek(0, 2), self.buffer.write(b), self.buffer.seek(ptr))
		self.newlines = 0
		return self.buffer.read()

	def readline(self):
		while self.newlines == 0:
			b = os.read(self._fd, max(os.fstat(self._fd).st_size, BUFSIZE))
			self.newlines = b.count(b'\n') + (not b)
			ptr = self.buffer.tell()
			(self.buffer.seek(0, 2), self.buffer.write(b), self.buffer.seek(ptr))
		self.newlines -= 1
		return self.buffer.readline()

	def flush(self):
		if self.writable:
			os.write(self._fd, self.buffer.getvalue())
			(self.buffer.truncate(0), self.buffer.seek(0))

class IOWrapper(IOBase):

	def __init__(self, file):
		self.buffer = FastIO(file)
		self.flush = self.buffer.flush
		self.writable = self.buffer.writable
		self.write = lambda s: self.buffer.write(s.encode('ascii'))
		self.read = lambda : self.buffer.read().decode('ascii')
		self.readline = lambda : self.buffer.readline().decode('ascii')
(sys.stdin, sys.stdout) = (IOWrapper(sys.stdin), IOWrapper(sys.stdout))
input = lambda : sys.stdin.readline().rstrip('\r\n')
main()


import sys
inpy = [int(x) for x in sys.stdin.read().split()]
t = inpy[0]
index = 1
for _ in range(t):
	(n, x) = (inpy[index], inpy[index + 1])
	nums = inpy[index + 2:index + 2 + n]
	index += 2 + n
	nums.sort(reverse=True)
	(res, cnt) = (0, 0)
	for i in nums:
		cnt += 1
		if i * cnt >= x:
			cnt = 0
			res += 1
	print(res)


import math as m

def solve():
	(n, x) = map(int, input().split())
	a = list(map(int, input().split()))
	a.sort()
	j = n - 1
	ans = 0
	while j > -1 and a[j] >= x:
		j -= 1
		ans += 1
	mar = [0] * (j + 1)
	for i in range(j + 1):
		mar[i] = m.ceil(x / a[i])
	cnt = 0
	while j > -1:
		cnt += 1
		if cnt == mar[j]:
			ans += 1
			cnt = 0
			j -= 1
			continue
		j -= 1
	print(ans)
t = int(input())
for _ in range(t):
	solve()


from sys import maxsize
for _ in range(int(input())):
	(n, x) = list(map(int, input().split()))
	s = list(map(int, input().split()))
	s.sort()
	c = i = 0
	arr = []
	m = maxsize
	while s:
		t = s.pop()
		if t >= x:
			c += 1
		else:
			i += 1
			m = min(m, t)
			if m * i >= x:
				c += 1
				i = 0
	print(c)


import math
t = int(input().strip())
while t:
	t -= 1
	(n, x) = list(map(int, input().strip().split()))
	arr = list(map(int, input().strip().split()))
	arr.sort(reverse=True)
	i = 0
	groups = 0
	members = 1
	while i < n:
		if members * arr[i] >= x:
			groups += 1
			members = 1
			i += 1
		else:
			members += 1
			i += 1
	print(groups)


def need(skill, x):
	if x % skill == 0:
		return x // skill
	else:
		return x // skill + 1
t = int(input())
for i in range(t):
	(n, x) = input().split()
	n = int(n)
	x = int(x)
	lista = input().split()
	for j in range(n):
		lista[j] = int(lista[j])
	lista.sort()
	teams = 0
	members = 0
	i = n - 1
	while i >= 0:
		if members >= need(lista[i], x) - 1:
			members -= need(lista[i], x) - 1
			teams += 1
			i -= 1
		else:
			i -= 1
			members += 1
	print(teams)


import math
t = int(input())
ans = []
for _ in range(t):
	(n, x) = map(int, input().split())
	a = [int(i) for i in input().split()]
	a.sort()
	dp = [0 for _ in range(n + 1)]
	for i in range(n - 1, -1, -1):
		min_members = int(math.ceil(x / a[i]))
		if i + min_members <= n:
			dp[i] = max(dp[i], 1 + dp[i + min_members])
		if i + 1 < n:
			dp[i] = max(dp[i], dp[i + 1])
	ans.append(max(dp))
ans = '\n'.join([str(i) for i in ans])
print(ans)


t = int(input())
for _ in range(t):
	(n, x) = map(int, input().split())
	A = list(map(int, input().split()))
	A.sort(reverse=True)
	team_size = 1
	total_teams = 0
	for a in A:
		if team_size * a >= x:
			team_size = 0
			total_teams += 1
		team_size += 1
	print(total_teams)


t = int(input())
for _ in range(t):
	(n, x) = map(int, input().split())
	a = list(map(int, input().split()))
	a.sort(reverse=True)
	count = 0
	team = 0
	i = 0
	while i < n:
		count += 1
		if a[i] >= x:
			team += 1
			count = 0
		elif count * a[i] >= x:
			team += 1
			count = 0
		i += 1
	print(team)


n = int(input())
for i in range(0, n):
	o = input().rstrip().split(' ')
	p = input().rstrip().split(' ')
	x = int(o[1])
	p.sort(key=int, reverse=True)
	ans = 0
	tot = 0
	for j in range(0, len(p)):
		A = int(p[j])
		ans += 1
		if ans * A >= x:
			ans = 0
			tot += 1
	print(tot)


for _ in range(int(input())):
	(n, x) = map(int, input().split())
	l = list(map(int, input().split()))
	l = sorted(l, reverse=True)
	ans = 0
	i = 0
	while i < len(l):
		if l[i] >= x:
			ans += 1
		else:
			count = 1
			while count * l[i] < x and i < len(l) - 1:
				i += 1
				count += 1
			if count * l[i] >= x:
				ans += 1
		i += 1
	print(ans)


t = int(input())
for i in range(t):
	(n, x) = map(int, input().split())
	a = [int(v) for v in input().split()]
	a.sort()
	p = n - 1
	c = 0
	v = 0
	for j in range(n - 1, -1, -1):
		c = c + 1
		if a[j] * c >= x:
			v = v + 1
			c = 0
	print(v)


from sys import stdin
t = int(stdin.readline())
for _ in range(t):
	(n, x) = list(map(int, stdin.readline().rstrip().split(' ')))
	arr = sorted(list(map(int, stdin.readline().rstrip().split(' '))), reverse=True)
	teams = 0
	currentLength = 0
	for i in range(n):
		currentLength += 1
		if arr[i] * currentLength >= x:
			teams += 1
			currentLength = 0
	print(teams)


import math
import bisect
import copy
import time
from collections import Counter
for _ in range(int(input())):
	(n, x) = map(int, input().split())
	l = [int(x) for x in input().split()]
	l.sort(reverse=True)
	c = 0
	i = 0
	j = 0
	while i < n and j < n:
		if l[i] >= x:
			c += 1
			i += 1
			j += 1
			continue
		if l[j] * (j - i + 1) >= x:
			c += 1
			i = j + 1
			j = j + 1
			continue
		j += 1
	print(c)


from collections import defaultdict
import math
t = int(input())
for _ in range(t):
	(n, x) = map(int, input().split())
	arr = list(map(int, input().split()))
	arr.sort()
	ch = []
	ans = 0
	for i in arr:
		if i < x:
			ch.append(i)
		else:
			ans += 1
	if len(ch) == 0:
		pass
	else:
		ch.sort(reverse=True)
		ct = 1
		for i in ch:
			if i * ct >= x:
				ans += 1
				ct = 1
			else:
				ct += 1
	print(ans)


t = int(input())
for foo in range(t):
	l = list(map(lambda x: int(x), input().strip().split(' ')))
	(n, x) = (l[0], l[1])
	a = list(map(lambda x: int(x), input().strip().split(' ')))
	a.sort()
	ans = len([_ for _ in a if _ >= x])
	if ans > 0:
		a = a[:-ans]
	if a == []:
		print(ans)
		continue
	nowlst = []
	for i in range(len(a) - 1, -1, -1):
		nowlst.append(a[i])
		if len(nowlst) * nowlst[-1] >= x:
			ans += 1
			nowlst = []
	print(ans)


t = int(input())
for _ in range(t):
	(n, x) = map(int, input().split())
	p = sorted(list(map(int, input().split())), reverse=True)
	(counter, total) = (1, 0)
	for e in p:
		if e * counter >= x:
			total += 1
			counter = 0
		counter += 1
	print(total)


t = int(input())
ans = []
for i in range(t):
	(n, x) = map(int, input().split())
	skills = list(map(int, input().split()))
	skills.sort(reverse=True)
	j = 0
	teams = 0
	while j < n:
		counter = 1
		while j < n and counter * skills[j] < x:
			j += 1
			counter += 1
		if j < n:
			teams += 1
			j += 1
	ans.append(teams)
for i in ans:
	print(i)


import sys
import math
from functools import reduce
import bisect

def getN():
	return int(input())

def getNM():
	return map(int, input().split())

def getList():
	return list(map(int, input().split()))

def input():
	return sys.stdin.readline().rstrip()

def index(a, x):
	i = bisect.bisect_left(a, x)
	if i != len(a) and a[i] == x:
		return i
	return False
for _ in range(int(input())):
	(n, k) = getNM()
	arr = getList()
	arr.sort()
	ans = 0
	for i in range(n):
		if arr[i] >= k:
			ans += n - i
			break
	dec = 1
	for i in range(n - ans - 1, -1, -1):
		if arr[i] * dec >= k:
			ans += 1
			dec = 1
		else:
			dec += 1
	print(ans)


T = int(input())
for _ in range(T):
	(N, X) = list(map(int, input().strip().split()))
	arr = list(map(int, input().strip().split()))
	arr.sort(reverse=True)
	count = 0
	size = 0
	for i in range(N):
		size += 1
		if arr[i] * size >= X:
			count += 1
			size = 0
	print(count)


for t in range(int(input())):
	(n, x) = map(int, input().split())
	arr = list(map(int, input().split()))
	arr.sort(reverse=True)
	count = 0
	i = 0
	prog = 0
	minim = 10 ** 10
	while i < n:
		ele = arr[i]
		prog += 1
		minim = min(minim, ele)
		if prog * minim >= x:
			count += 1
			prog = 0
			minim = 10 ** 10
		i += 1
	print(count)


for _ in range(int(input())):
	(n, x) = map(int, input().split())
	arr = list(map(int, input().split()))
	arr.sort(reverse=True)
	cur = [arr[0]]
	count = 0
	for i in range(1, n):
		length = len(cur)
		if length * cur[-1] < x:
			cur.append(arr[i])
		else:
			count += 1
			cur = [arr[i]]
	if len(cur) * cur[-1] >= x:
		count += 1
	print(count)


p = lambda : map(int, input().split())
(T,) = p()
while T:
	(n, x) = p()
	a = sorted(p())
	t = 0
	while a:
		c = 1
		while a and c * a[-1] < x:
			c += 1
			a.pop()
		if a:
			t += 1
			a.pop()
	print(t)
	T -= 1


for _ in range(int(input())):
	(n, x) = map(int, input().split())
	arr = list(map(int, input().split()))
	arr = sorted(arr, reverse=True)
	arr.insert(0, -1)
	temp = 0
	count = 0
	for i in range(1, n + 1):
		if arr[i] * (i - temp) >= x:
			count += 1
			temp = i
	print(count)


import string
get_int = lambda : int(input())
get_mul_int = lambda : map(int, input().rstrip().split())
get_list = lambda : list(map(int, input().rstrip().split()))
TEST_CASES = True

def main():
	(n, x) = get_mul_int()
	skill = get_list()
	skill.sort(reverse=True)
	(team, factor, i) = (0, 1, 0)
	while i < n:
		if skill[i] * factor >= x:
			team += 1
			i += factor
		else:
			factor += 1
			i += 1
	print(team)
if not TEST_CASES:
	main()
else:
	[main() for _ in range(int(input()))]


import sys
input = sys.stdin.buffer.readline
t = int(input())
for _ in range(t):
	(n, x) = [int(x) for x in input().split()]
	arr = [int(x) for x in input().split()]
	arr.sort(reverse=True)
	cnts = 0
	start = -1
	for i in range(n):
		if arr[i] * (i - start) >= x:
			cnts += 1
			start = i
	print(cnts)


import math
t = int(input())
for _ in range(t):
	(n, x) = map(int, input().split())
	a = [int(s) for s in input().split()]
	a.sort(reverse=True)
	teams = 0
	m = math.inf
	cnt = 0
	for s in a:
		cnt += 1
		if s < m:
			m = s
		if m * cnt >= x:
			cnt = 0
			m = math.inf
			teams += 1
	print(teams)


import sys
from functools import lru_cache, cmp_to_key
from heapq import merge, heapify, heappop, heappush
from collections import defaultdict as dd, deque, Counter as C
from itertools import combinations as comb, permutations as perm
from bisect import bisect_left as bl, bisect_right as br, bisect
from time import perf_counter
from fractions import Fraction
mod = int(pow(10, 9) + 7)
mod2 = 998244353

def data():
	return sys.stdin.readline().strip()

def out(*var, end='\n'):
	sys.stdout.write(' '.join(map(str, var)) + end)

def L():
	return list(sp())

def sl():
	return list(ssp())

def sp():
	return map(int, data().split())

def ssp():
	return map(str, data().split())

def l1d(n, val=0):
	return [val for i in range(n)]

def l2d(n, m, val=0):
	return [l1d(n, val) for j in range(m)]
try:
	sys.stdin = open('input.txt', 'r')
except:
	pass
t = L()[0]
for _ in range(t):
	(n, x) = L()
	A = L()
	A.sort(reverse=True)
	i = 0
	cnt = 0
	while i < n:
		mem = 1
		while i + mem <= n and A[i + mem - 1] * mem < x:
			mem += 1
		if i + mem <= n and A[i + mem - 1] * mem >= x:
			cnt += 1
		i += mem
	print(cnt)


def sol(arr: list, x: int) -> int:
	idiot = [i for i in arr if i < x]
	ans = len(arr) - len(idiot)
	idiot.sort()
	prev = 0
	while idiot:
		prev += 1
		tail = idiot.pop()
		if tail * prev >= x:
			cursize = prev
			while idiot and idiot[-1] * cursize >= x:
				idiot.pop()
				prev += 1
			ans += prev // cursize
			prev %= cursize
	return ans
tmp = []
p = print

def print(*args, **kwargs):
	tmp.append((args, kwargs))

def flush():
	for (args, kwargs) in tmp:
		p(*args, **kwargs)
	return
T = int(input())
for _ in range(T):
	(n, x) = map(int, input().split(' '))
	arr = [*map(int, input().split(' '))]
	out = sol(arr, x)
	print(out)
flush()


for t in range(int(input())):
	(n, x) = list(map(int, input().split()))
	integers = sorted(list(map(int, input().split())))
	teams = 0
	sub_team = []
	team_length = 0
	for i in range(n - 1, -1, -1):
		sub_team.append(integers[i])
		team_length += 1
		if sub_team[-1] * team_length >= x:
			teams += 1
			sub_team = []
			team_length = 0
	print(teams)


import sys
import math
import heapq
import collections

def inputnum():
	return int(input())

def inputnums():
	return map(int, input().split())

def inputlist():
	return list(map(int, input().split()))

def inputstring():
	return [x for x in input()]

def inputmatrixchar(rows):
	arr2d = [[j for j in input().strip()] for i in range(rows)]
	return arr2d

def inputmatrixint(rows):
	arr2d = []
	for _ in range(rows):
		arr2d.append([int(i) for i in input().split()])
	return arr2d
t = int(input())
for q in range(t):
	(n, x) = inputnums()
	a = inputlist()
	a.sort(reverse=True)
	cur = 0
	ans = 0
	for i in range(n):
		cur += 1
		if cur * a[i] >= x:
			ans += 1
			cur = 0
	print(ans)


for _ in range(int(input())):
	(n, x) = map(int, input().split())
	arr = list(map(int, input().split()))
	arr.sort()
	arr.reverse()
	m = cnt = 0
	for n in arr:
		m += 1
		if m * n >= x:
			cnt += 1
			m = 0
	print(cnt)


from bisect import *
from collections import *
from itertools import *
import functools
import sys
import math
from decimal import *
from copy import *
from heapq import *
from fractions import *
getcontext().prec = 30
MAX = sys.maxsize
MAXN = 1000010
MOD = 10 ** 9 + 7
spf = [i for i in range(MAXN)]
spf[0] = spf[1] = -1

def sieve():
	for i in range(2, MAXN, 2):
		spf[i] = 2
	for i in range(3, int(MAXN ** 0.5) + 1):
		if spf[i] == i:
			for j in range(i * i, MAXN, i):
				if spf[j] == j:
					spf[j] = i

def fib(n, m):
	if n == 0:
		return [0, 1]
	else:
		(a, b) = fib(n // 2)
		c = a % m * (b % m * 2 - a % m) % m
		d = a % m * (a % m) % m + b % m * b % m % m
		if n % 2 == 0:
			return [c, d]
		else:
			return [d, c + d]

def charIN(x=' '):
	return sys.stdin.readline().strip().split(x)

def arrIN(x=' '):
	return list(map(int, sys.stdin.readline().strip().split(x)))

def ncr(n, r):
	num = den = 1
	for i in range(r):
		num = num * (n - i) % MOD
		den = den * (i + 1) % MOD
	return num * pow(den, MOD - 2, MOD) % MOD

def flush():
	return sys.stdout.flush()
for _ in range(int(input())):
	(n, x) = arrIN()
	a = arrIN()
	a.sort()
	b = [0] * (n + 1)
	for i in range(n - 1, -1, -1):
		if math.ceil(x / a[i]) <= n - i:
			b[i] = 1 + b[i + math.ceil(x / a[i])]
	print(max(b))


import sys
(input, print) = (sys.stdin.readline, sys.stdout.write)
for _ in range(int(input())):
	(n, x) = map(int, input().split())
	a = list(map(int, input().split()))
	a.sort()
	(ans, temp, l) = (0, [], 0)
	for i in range(n - 1, -1, -1):
		if a[i] >= x:
			ans += 1
		else:
			temp.append(a[i])
			l += 1
			if l * temp[-1] >= x:
				l = 0
				temp = []
				ans += 1
	print(str(ans) + '\n')


t = int(input())
for _ in range(0, t):
	nx = input()
	nx = nx.split(' ')
	n = int(nx[0])
	x = int(nx[1])
	a = input()
	a = a.split(' ')
	a = list(map(int, a))
	a.sort(reverse=True)
	teams = 0
	j = 1
	for i in range(0, len(a)):
		score = j * a[i]
		if score >= x:
			teams += 1
			j = 1
		else:
			j += 1
	print(teams)


t = int(input())
for i in range(0, t):
	nx = input().split()
	n = int(nx[0])
	x = int(nx[1])
	L = list(map(int, input().split()))
	L.sort()
	L.reverse()
	count = 0
	size = 1
	for e in L:
		if e * size >= x:
			count += 1
			size = 0
		size += 1
	print(count)


from sys import stdin

def iinput():
	return int(stdin.readline())

def minput():
	return map(int, stdin.readline().split())

def linput():
	return list(map(int, stdin.readline().split()))
t = iinput()
while t:
	t -= 1
	(n, x) = minput()
	a = linput()
	a.sort(reverse=True)
	i = 0
	temp = 0
	m = 0
	cnt = 0
	while i < n:
		m += 1
		temp = a[i]
		if m * temp >= x:
			cnt += 1
			m = 0
		i += 1
	print(cnt)


import sys
inputlist = sys.stdin.readlines()
number_of_testcases = int(inputlist[0].strip())
i = 0
while i < 2 * number_of_testcases:
	i += 1
	(n, x) = list(map(int, inputlist[i].strip().split(' ')))
	i += 1
	numbers_list = list(map(int, inputlist[i].strip().split(' ')))
	numbers_list.sort(reverse=True)
	total_teams = 0
	players_till_now = 0
	for j in numbers_list:
		players_till_now += 1
		if players_till_now * j >= x:
			total_teams += 1
			players_till_now = 0
	print(total_teams)


import sys
input = sys.stdin.readline
from collections import Counter
t = int(input())
for tests in range(t):
	(n, x) = map(int, input().split())
	A = sorted(map(int, input().split()), reverse=True)
	NOW = 0
	ANS = 0
	MIN = 1 << 60
	for a in A:
		MIN = min(a, MIN)
		NOW += 1
		if MIN * NOW >= x:
			ANS += 1
			MIN = 1 << 60
			NOW = 0
	print(ANS)


import sys
import math as mt
input = sys.stdin.readline
t = int(input())
for _ in range(t):
	(n, x) = map(int, input().split())
	l = list(map(int, input().split()))
	l.sort(reverse=True)
	rem = 0
	ans = 0
	for i in range(n):
		rem += 1
		req = mt.ceil(x / l[i])
		if req <= rem:
			ans += 1
			rem -= req
	print(ans)


from math import ceil as c
for _ in range(int(input())):
	(n, x) = list(map(int, input().split()))
	a = list(map(int, input().split()))
	a.sort(reverse=True)
	ct = 0
	res = 0
	for i in a:
		ct += 1
		if ct * i >= x:
			res += 1
			ct = 0
	print(res)


from __future__ import division, print_function
import os, sys
from io import BytesIO, IOBase
if sys.version_info[0] < 3:
	from __builtin__ import xrange as range
	from future_builtins import ascii, filter, hex, map, oct, zip

def ii():
	return int(input())

def fi():
	return float(input())

def si():
	return input()

def msi():
	return map(str, input().split())

def mi():
	return map(int, input().split())

def li():
	return list(mi())

def read():
	sys.stdin = open('input.txt', 'r')
	sys.stdout = open('output.txt', 'w')

def gcd(x, y):
	while y:
		(x, y) = (y, x % y)
	return x
mod = 1000000007

def modInverse(b, m):
	g = gcd(b, m)
	if g != 1:
		return -1
	else:
		return pow(b, m - 2, m)

def modu(a, b, m):
	a = a % m
	inv = modInverse(b, m)
	if inv == -1:
		return -999999999
	else:
		return inv * a % m
from math import log, sqrt, factorial, cos, tan, sin, radians, ceil, floor
import bisect
from decimal import *
getcontext().prec = 25
abc = 'abcdefghijklmnopqrstuvwxyz'
pi = 3.141592653589793

def fn(a, b):
	c = 1
	while a > b:
		b *= 2
		c += 1
	return c

def main():
	for _ in range(ii()):
		(n, x) = mi()
		a = li()
		a.sort(reverse=True)
		ans = 0
		cur = 1
		for i in range(n):
			if a[i] * cur >= x:
				ans += 1
				cur = 1
			else:
				cur += 1
		print(ans)
BUFSIZE = 8192

class FastIO(IOBase):
	newlines = 0

	def __init__(self, file):
		self._fd = file.fileno()
		self.buffer = BytesIO()
		self.writable = 'x' in file.mode or 'r' not in file.mode
		self.write = self.buffer.write if self.writable else None

	def read(self):
		while True:
			b = os.read(self._fd, max(os.fstat(self._fd).st_size, BUFSIZE))
			if not b:
				break
			ptr = self.buffer.tell()
			(self.buffer.seek(0, 2), self.buffer.write(b), self.buffer.seek(ptr))
		self.newlines = 0
		return self.buffer.read()

	def readline(self):
		while self.newlines == 0:
			b = os.read(self._fd, max(os.fstat(self._fd).st_size, BUFSIZE))
			self.newlines = b.count(b'\n') + (not b)
			ptr = self.buffer.tell()
			(self.buffer.seek(0, 2), self.buffer.write(b), self.buffer.seek(ptr))
		self.newlines -= 1
		return self.buffer.readline()

	def flush(self):
		if self.writable:
			os.write(self._fd, self.buffer.getvalue())
			(self.buffer.truncate(0), self.buffer.seek(0))

class IOWrapper(IOBase):

	def __init__(self, file):
		self.buffer = FastIO(file)
		self.flush = self.buffer.flush
		self.writable = self.buffer.writable
		self.write = lambda s: self.buffer.write(s.encode('ascii'))
		self.read = lambda : self.buffer.read().decode('ascii')
		self.readline = lambda : self.buffer.readline().decode('ascii')

def print(*args, **kwargs):
	(sep, file) = (kwargs.pop('sep', ' '), kwargs.pop('file', sys.stdout))
	at_start = True
	for x in args:
		if not at_start:
			file.write(sep)
		file.write(str(x))
		at_start = False
	file.write(kwargs.pop('end', '\n'))
	if kwargs.pop('flush', False):
		file.flush()
if sys.version_info[0] < 3:
	(sys.stdin, sys.stdout) = (FastIO(sys.stdin), FastIO(sys.stdout))
else:
	(sys.stdin, sys.stdout) = (IOWrapper(sys.stdin), IOWrapper(sys.stdout))
input = lambda : sys.stdin.readline().rstrip('\r\n')
main()


import sys

def get_line():
	return list(map(int, sys.stdin.readline().strip().split()))

def in1():
	return int(input())
for _ in range(in1()):
	(n, x) = map(int, input().split())
	a = get_line()
	d = {}
	c = 0
	l = 0
	for i in range(n):
		t1 = x // a[i]
		if x % a[i] != 0:
			t1 += 1
		if t1 not in d.keys():
			d[t1] = [a[i]]
		else:
			r = d[t1]
			r.append(a[i])
			d[t1] = r
	b = sorted(d.items())
	for i in range(len(b)):
		if b[i][0] == 0 or b[i][0] == 1:
			c += len(b[i][1])
		else:
			t2 = len(b[i][1])
			l += t2
			if l >= b[i][0]:
				t1 = l // b[i][0]
				c += t1
				l -= t1 * b[i][0]
	print(c)


T = int(input())
while T > 0:
	(n, x) = map(int, input().split())
	arr = list(map(int, input().split()))
	arr.sort()
	need = [0] * n
	for i in range(n):
		temp = x // arr[i]
		if x % arr[i] != 0:
			temp += 1
		need[i] = temp
	dp = [0] * n
	res = 0
	for i in range(n - 1, -1, -1):
		index = i + need[i]
		if index == n:
			dp[i] = 1
		elif index < n:
			dp[i] = 1 + dp[index]
		res = max(res, dp[i])
	print(res)
	T -= 1


t = int(input())
while t:
	(n, x) = map(int, input().split())
	l = list(map(int, input().split()))
	l.sort(reverse=True)
	ans = 0
	c = 1
	i = 0
	while i < n:
		if l[i] * c >= x:
			ans += 1
			c = 0
		i += 1
		c += 1
	print(ans)
	t = t - 1


t = int(input())
for _ in range(t):
	(n, x) = map(int, input().split())
	a = list(map(int, input().split()))
	a.sort()
	n -= 1
	cnt = 1
	ans = 0
	while n >= 0:
		if cnt * a[n] >= x:
			cnt = 1
			ans += 1
		else:
			cnt += 1
		n -= 1
	print(ans)


t = int(input())
for tt in range(t):
	(n, x) = map(int, input().split())
	a = list(map(int, input().split()))
	a.sort()
	a.reverse()
	cur = 0
	teams = 0
	for i in range(n):
		cur += 1
		if a[i] * cur >= x:
			teams += 1
			cur = 0
	print(teams)


from collections import Counter, deque
t = int(input())
for _ in range(t):
	(n, x) = map(int, input().split())
	a = sorted(list(map(int, input().split())))
	d = deque()
	now = [100000000000, 0]
	for i in range(n - 1, -1, -1):
		now = [min(now[0], a[i]), now[1] + 1]
		if now[0] * now[1] >= x:
			d.append(now)
			now = [100000000000, 0]
	print(len(d))


for _ in range(int(input())):
	(n, x) = map(int, input().split())
	a = sorted(list(map(int, input().split())), reverse=True)
	ok = 1
	ans = 0
	i = 0
	while i < n:
		try:
			if a[i + ok - 1] * ok >= x:
				ans += 1
				i += ok
			else:
				ok += 1
		except:
			break
	print(ans)


def solve():
	(n, x) = map(int, input().split())
	a = list(map(int, input().split()))
	a.sort(reverse=True)
	j = 0
	ans = 0
	for i in range(n):
		if (i - j + 1) * a[i] >= x:
			j = i + 1
			ans += 1
	print(ans)
t = int(input())
for test in range(t):
	solve()


def main():
	(n, x) = map(int, input().split(' '))
	a = list(map(int, input().split(' ')))
	a.sort(reverse=True)
	z = 0
	beg = 0
	end = 0
	while end < n:
		if a[end] * (end - beg + 1) >= x:
			z += 1
			beg = end + 1
			end = beg + 0
		else:
			end += 1
	print(z)
for _ in range(int(input())):
	main()


t = int(input())
for _ in range(t):
	(n, x) = map(int, input().split(' '))
	a = list(map(int, input().split(' ')))
	a.sort(reverse=True)
	s = 0
	t = []
	count = 0
	for y in range(n):
		s = s + 1
		if a[y] * s >= x:
			count = count + 1
			s = 0
	print(count)


import sys
input = sys.stdin.readline
for _ in range(int(input())):
	(n, x) = map(int, input().split())
	s = list(map(int, input().split()))
	s.sort()
	s.reverse()
	i = 1
	out = 0
	for j in s:
		if j * i >= x:
			out += 1
			i = 0
		i += 1
	print(out)


import os
import sys
from io import BytesIO, IOBase
BUFSIZE = 8192

class FastIO(IOBase):
	newlines = 0

	def __init__(self, file):
		self._fd = file.fileno()
		self.buffer = BytesIO()
		self.writable = 'x' in file.mode or 'r' not in file.mode
		self.write = self.buffer.write if self.writable else None

	def read(self):
		while True:
			b = os.read(self._fd, max(os.fstat(self._fd).st_size, BUFSIZE))
			if not b:
				break
			ptr = self.buffer.tell()
			(self.buffer.seek(0, 2), self.buffer.write(b), self.buffer.seek(ptr))
		self.newlines = 0
		return self.buffer.read()

	def readline(self):
		while self.newlines == 0:
			b = os.read(self._fd, max(os.fstat(self._fd).st_size, BUFSIZE))
			self.newlines = b.count(b'\n') + (not b)
			ptr = self.buffer.tell()
			(self.buffer.seek(0, 2), self.buffer.write(b), self.buffer.seek(ptr))
		self.newlines -= 1
		return self.buffer.readline()

	def flush(self):
		if self.writable:
			os.write(self._fd, self.buffer.getvalue())
			(self.buffer.truncate(0), self.buffer.seek(0))

class IOWrapper(IOBase):

	def __init__(self, file):
		self.buffer = FastIO(file)
		self.flush = self.buffer.flush
		self.writable = self.buffer.writable
		self.write = lambda s: self.buffer.write(s.encode('ascii'))
		self.read = lambda : self.buffer.read().decode('ascii')
		self.readline = lambda : self.buffer.readline().decode('ascii')
(sys.stdin, sys.stdout) = (IOWrapper(sys.stdin), IOWrapper(sys.stdout))
input = lambda : sys.stdin.readline().rstrip('\r\n')

def RL():
	return map(int, sys.stdin.readline().rstrip().split())

def RLL():
	return list(map(int, sys.stdin.readline().rstrip().split()))

def N():
	return int(input())

def comb(n, m):
	return factorial(n) / (factorial(m) * factorial(n - m)) if n >= m else 0

def perm(n, m):
	return factorial(n) // factorial(n - m) if n >= m else 0

def mdis(x1, y1, x2, y2):
	return abs(x1 - x2) + abs(y1 - y2)
mod = 998244353
INF = float('inf')
from math import factorial, ceil
from collections import Counter, defaultdict, deque
from heapq import heapify, heappop, heappush

def main():
	for _ in range(N()):
		(n, x) = RL()
		arr = RLL()
		arr.sort(reverse=1)
		res = i = 0
		pre = -1
		while i < n:
			now = arr[i]
			num = ceil(x / now)
			if i - pre >= num:
				res += 1
				pre = i
			i += 1
		print(res)
main()


ll = lambda : map(int, input().split())
t = lambda : int(input())
ss = lambda : input()
for _ in range(t()):
	(n, x) = ll()
	a = list(ll())
	a.sort()
	cur = 1
	ans = 0
	for i in range(n - 1, -1, -1):
		if cur * a[i] >= x:
			ans += 1
			cur = 0
		cur += 1
	print(ans)


from sys import stdin
for _ in range(int(input())):
	(n, k) = map(int, stdin.readline().rstrip().split(' '))
	l = list(map(int, stdin.readline().rstrip().split(' ')))
	l.sort(reverse=True)
	le = 0
	t = 0
	singles = True
	for i in range(n):
		if singles:
			if l[i] >= k:
				t += 1
			else:
				singles = False
				le = 1
		else:
			le += 1
			if l[i] * le >= k:
				t += 1
				le = 0
	print(t)


for _ in range(int(input())):
	(n, x) = map(int, input().split())
	a = list(map(int, input().split()))
	ans = 0
	l = []
	for i in range(n):
		if a[i] < x:
			l.append(a[i])
		else:
			ans += 1
	count = 0
	l.sort()
	while l:
		k = l.pop()
		count += 1
		if k * count >= x:
			ans += 1
			count = 0
	print(ans)


import sys
import os
readline = sys.stdin.readline
t = int(input())
while t:
	t -= 1
	(n, x) = map(int, input().split())
	a = list(map(int, input().split()))
	a.sort()
	a.reverse()
	k = 0
	res = 0
	for i in range(n):
		k += 1
		if k * a[i] >= x:
			res += 1
			k = 0
	print(res)


from sys import stdin, setrecursionlimit, stdout
from collections import deque
from math import sqrt, floor, ceil, log, log2, log10, pi, gcd, sin, cos, asin
from heapq import heapify, heappop, heappush, heapreplace, heappushpop

def ii():
	return int(stdin.readline())

def fi():
	return float(stdin.readline())

def mi():
	return map(int, stdin.readline().split())

def fmi():
	return map(float, stdin.readline().split())

def li():
	return list(mi())

def si():
	return stdin.readline().rstrip()

def lsi():
	return list(si())
res = ['YES', 'NO']

def solve():
	(n, x) = mi()
	a = li()
	a.sort(reverse=True)
	z = 1
	c = 0
	for i in range(n):
		a[i] = (x + a[i] - 1) // a[i]
		if a[i] <= z:
			c += 1
			z = 0
		z += 1
	return c
test_case = ii()
while test_case:
	test_case -= 1
	print(solve())


def test():
	(n, x) = map(int, input().split())
	a = list(map(int, input().split()))
	a.sort()
	c = 1
	ans = 0
	for i in range(n, 0, -1):
		if c * a[i - 1] >= x:
			c -= int((x + a[i - 1] - 1) / a[i - 1])
			ans += 1
		c += 1
	print(ans)
q = int(input())
for i in range(q):
	test()


MOD = 1000000007
ii = lambda : int(input())
si = lambda : input()
dgl = lambda : list(map(int, input()))
f = lambda : map(int, input().split())
il = lambda : list(map(int, input().split()))
ls = lambda : list(input())
from collections import *
for _ in range(ii()):
	(n, x) = f()
	a = il()
	a.sort(reverse=True)
	l = 1
	c = 0
	for i in range(0, n):
		if a[i] * l >= x:
			c = c + 1
			l = 1
		else:
			l = l + 1
	print(c)


for t in range(int(input())):
	(n, x) = map(int, input().split())
	arr = list(map(int, input().split()))
	arr.sort(reverse=True)
	i = ans = 0
	while i < n:
		if arr[i] >= x:
			ans += 1
		else:
			i += 1
			v = 2
			while i < n:
				if arr[i] * v >= x:
					ans += 1
					break
				else:
					i += 1
					v += 1
		i += 1
	print(ans)


for _ in range(int(input())):
	(n, x) = map(int, input().split())
	a = list(map(int, input().split()))
	a.sort()
	dp = [0] * (n + 1)
	for i in range(n - 1, -1, -1):
		num = (x - 1) // a[i] + 1
		if i + num <= n:
			dp[i] = max(1 + dp[i + num], dp[i + 1])
		else:
			dp[i] = dp[i + 1]
	print(dp[0])


T = int(input())
for _ in range(T):
	(n, x) = map(int, input().split())
	ls = sorted(list(map(int, input().split())), reverse=True)
	ans = 0
	team = []
	for i in ls:
		if i >= x:
			ans += 1
		else:
			team.append(i)
		if len(team) != 0:
			if team[-1] * len(team) >= x:
				ans += 1
				team = []
	print(ans)


t = int(input())
for _ in range(t):
	(n, x) = map(int, input().split())
	a = list(map(int, input().split()))
	a.sort()
	k = 0
	j = n - 1
	for i in range(n - 1, -1, -1):
		if a[i] >= x:
			k += 1
			j -= 1
		else:
			break
	r = 1
	while j >= 0:
		if a[j] * r < x:
			j -= 1
			r += 1
		else:
			k += 1
			j -= 1
			r = 1
	print(k)


t = int(input())
while t:
	(n, x) = [int(a) for a in input().split()]
	skill = [int(a) for a in input().split()]
	for i in range(n):
		if x % skill[i] == 0:
			skill[i] = x / skill[i] - 1
		else:
			skill[i] = x // skill[i]
	skill.sort()
	count = 0
	remaining_num = 0
	for i in range(n):
		if skill[i] == 0:
			count += 1
		elif remaining_num == skill[i]:
			count += 1
			remaining_num = 0
		else:
			remaining_num += 1
	print(count)
	t -= 1


for z in range(int(input())):
	(n, x) = map(int, input().split())
	a = sorted(map(int, input().split()), reverse=True)
	c = i = 0
	while i < n:
		m = l = 0
		while i < n and m < x:
			l += 1
			m = l * a[i]
			i += 1
		if m >= x:
			c += 1
	print(c)


from sys import stdin, stdout
t = int(stdin.readline().strip())
for _ in range(t):
	(n, x) = map(int, stdin.readline().split())
	a = list(map(int, stdin.readline().split()))
	a.sort(reverse=True)
	(c, ans) = (0, 0)
	for i in range(n):
		if a[i] >= x:
			ans += 1
		else:
			c += 1
			if a[i] * c >= x:
				ans += 1
				c = 0
	stdout.write('{}\n'.format(ans))


for _ in range(int(input())):
	(n, x) = map(int, input().split())
	l = list(map(int, input().split()))
	l.sort()
	m = 10 ** 9 + 1
	k = 0
	cnt = 0
	while len(l) > 0:
		s = l.pop()
		k = k + 1
		if s < m:
			m = s
		if k * m >= x:
			cnt = cnt + 1
			k = 0
			m = 10 ** 9 + 1
	print(cnt)


tc = int(input())
for i in range(tc):
	(n, x) = map(int, input().split())
	v = list(map(int, input().split()))
	v.sort(reverse=True)
	ans = 0
	cnt = 1
	for it in v:
		if it * cnt >= x:
			ans += 1
			cnt = 0
		cnt += 1
	print(ans)


In = input
for _ in range(int(In())):
	(n, x) = map(int, In().split())
	a = [int(i) for i in In().split()]
	a.sort(reverse=1)
	ans = 0
	i = 0
	while i < n:
		count = 1
		while i < n and count * a[i] < x:
			(i, count) = (i + 1, count + 1)
		if i < n:
			ans += 1
		i += 1
	print(ans)


def read_list():
	return list(map(int, input().split(' ')))

def print_list(l):
	print(' '.join(map(str, l)))
import math
N = int(input())
for _ in range(N):
	(n, x) = read_list()
	a = read_list()
	a.sort()
	split = math.ceil(x / a[0])
	res = 0
	i = 0
	while i < n:
		split = math.ceil(x / a[i] + i)
		i += 1
		while i < split and i < n:
			split = min(split, math.ceil(x / a[i]) + i)
			i += 1
		if split <= n:
			res += 1
	print(res)


t = int(input())
for _ in range(t):
	(n, x) = map(int, input().split())
	A = [int(x) for x in input().split()]
	A.sort(reverse=True)
	teams = 0
	sz = 0
	for a in A:
		sz += 1
		if a * sz >= x:
			teams += 1
			sz = 0
	print(teams)


t = int(input())
for o in range(t):
	(n, x) = map(int, input().strip().split())
	a = list(map(int, input().strip().split()))
	a.sort()
	numOfTeams = 0
	curTeamSize = 0
	for i in range(len(a) - 1, -1, -1):
		curTeamSize += 1
		if curTeamSize * a[i] >= x:
			curTeamSize = 0
			numOfTeams += 1
	print(numOfTeams)


import sys
import math
cases = int(input())
while cases > 0:
	(n, x) = [int(e) for e in input().split()]
	arr = [int(e) for e in input().split()]
	arr.sort(reverse=True)
	tc = 0
	cumm = 0
	MAXX = 10 ** 9 + 1
	minm = MAXX
	gsize = 0
	for i in range(n):
		if minm > arr[i]:
			minm = arr[i]
		gsize += 1
		cumm = minm * gsize
		if cumm >= x:
			tc += 1
			gsize = 0
			cumm = 0
			minm = MAXX
	print(tc)
	cases -= 1


import sys
input = sys.stdin.readline
f = lambda : list(map(int, input().split()))
res = []
for _ in range(int(input())):
	(n, x) = f()
	a = sorted(f(), reverse=True)
	c = 1
	ans = 0
	for i in a:
		if i * c >= x:
			ans += 1
			c = 0
		c += 1
	res.append(ans)
print('\n'.join(map(str, res)))


import sys
import math
import itertools
import functools
import collections
import operator
import fileinput
import copy
ORDA = 97

def ii():
	return int(input())

def mi():
	return map(int, input().split())

def li():
	return [int(i) for i in input().split()]

def lcm(a, b):
	return abs(a * b) // math.gcd(a, b)

def revn(n):
	return str(n)[::-1]

def dd():
	return collections.defaultdict(int)

def ddl():
	return collections.defaultdict(list)

def sieve(n):
	if n < 2:
		return list()
	prime = [True for _ in range(n + 1)]
	p = 3
	while p * p <= n:
		if prime[p]:
			for i in range(p * 2, n + 1, p):
				prime[i] = False
		p += 2
	r = [2]
	for p in range(3, n + 1, 2):
		if prime[p]:
			r.append(p)
	return r

def divs(n, start=2):
	r = []
	for i in range(start, int(math.sqrt(n) + 1)):
		if n % i == 0:
			if n / i == i:
				r.append(i)
			else:
				r.extend([i, n // i])
	return r

def divn(n, primes):
	divs_number = 1
	for i in primes:
		if n == 1:
			return divs_number
		t = 1
		while n % i == 0:
			t += 1
			n //= i
		divs_number *= t

def prime(n):
	if n == 2:
		return True
	if n % 2 == 0 or n <= 1:
		return False
	sqr = int(math.sqrt(n)) + 1
	for d in range(3, sqr, 2):
		if n % d == 0:
			return False
	return True

def convn(number, base):
	newnumber = 0
	while number > 0:
		newnumber += number % base
		number //= base
	return newnumber

def cdiv(n, k):
	return n // k + (n % k != 0)

def ispal(s):
	for i in range(len(s) // 2 + 1):
		if s[i] != s[-i - 1]:
			return False
	return True
for _ in range(ii()):
	(n, x) = mi()
	a = sorted(li(), reverse=True)
	ans = 0
	i = 0
	while i < n:
		t = i
		mul = 1
		x_ = 0
		while t < n and x_ < x:
			x_ = a[t] * mul
			if x_ >= x:
				ans += 1
				break
			mul += 1
			t += 1
		i = t + 1
	print(ans)


import sys
import collections
import math

def input():
	return sys.stdin.readline().rstrip()

def split_input():
	return [int(i) for i in input().split()]
tests = int(input())
for _ in range(tests):
	(n, x) = split_input()
	a = split_input()
	a.sort(reverse=True)
	ind = -1
	ans = 0
	for i in range(n):
		numpeople = int(math.ceil(x / a[i]))
		if i - ind >= numpeople:
			ans += 1
			ind = i
	print(ans)


import sys
lines = []
for line in sys.stdin:
	if 'exit' == line.rstrip().lower():
		break
	lines.append(line)
t = int(lines[0])
for case in range(1, 2 * t + 1, 2):
	l = [int(x) for x in lines[case].split(' ')]
	n = l[0]
	x = l[1]
	a = [int(x) for x in lines[case + 1].split(' ')]
	a = sorted(a, reverse=True)
	num_teams = 0
	np = 1
	i = 0
	while i < len(a):
		if a[i] * np >= x:
			num_teams += 1
			np = 0
		i += 1
		np += 1
	print(num_teams)


from sys import stdin
input = stdin.readline
for _ in range(int(input())):
	(n, x) = map(int, input().split())
	lis = list(map(int, input().split()))
	lis.sort(reverse=True)
	c = 0
	m = 0
	d = 0
	for i in range(n):
		d += 1
		m = lis[i]
		if d * m >= x:
			c += 1
			d = 0
			m = 0
	print(c)


from math import *
z = int(input())
for q in range(z):
	(n, x) = map(int, input().split())
	a = list(map(int, input().split()))
	a.sort()
	b = a[::-1]
	ans = 0
	m = 1
	for i in b:
		if i * m >= x:
			ans += 1
			m = 0
		m += 1
	print(ans)


t = int(input())
for _ in range(t):
	(n, k) = map(int, input().split())
	l = sorted(list(map(int, input().split())))
	l = l[::-1]
	c = 0
	j = 1
	for i in range(n):
		s = l[i] * j
		if s >= k:
			s = 0
			j = 1
			c = c + 1
		else:
			j += 1
	print(c)


from sys import stdin, stdout
outputs = []
for __ in range(int(stdin.readline().strip())):
	(n, x) = map(int, stdin.readline().strip().split())
	arr = list(map(int, stdin.readline().strip().split()))
	arr.sort()
	prev_size = 0
	res = 0
	while arr:
		prev_size += 1
		if arr[-1] >= x:
			prev_size -= 1
			arr.pop()
			res += 1
		else:
			req = x // arr[-1] if x % arr[-1] == 0 else x // arr[-1] + 1
			if req > prev_size:
				arr.pop()
			else:
				prev_size -= req
				arr.pop()
				res += 1
	outputs.append(res)
for output in outputs:
	stdout.write(f'{output}\n')


from math import ceil
from collections import Counter
for _ in range(int(input())):
	(n, x) = map(int, input().split())
	l = list(map(int, input().split()))
	count = 0
	for i in range(len(l)):
		l[i] = ceil(x / l[i])
	l.sort()
	num = list(Counter(l).items())
	l.clear()
	for i in range(len(num)):
		count += num[i][1] // num[i][0]
		for j in range(num[i][1] % num[i][0]):
			l.append(num[i][0])
	x = 1
	for i in range(len(l)):
		if l[i] == x:
			x = 0
			count += 1
		x += 1
	print(count)


import bisect
import os
import gc
import sys
from io import BytesIO, IOBase
from collections import Counter
from collections import deque
import heapq
import math
import statistics

def sin():
	return input()

def ain():
	return list(map(int, sin().split()))

def sain():
	return input().split()

def iin():
	return int(sin())
MAX = float('inf')
MIN = float('-inf')
MOD = 1000000007

def readTree(n, m):
	adj = [deque([]) for _ in range(n + 1)]
	for _ in range(m):
		(u, v) = ain()
		adj[u].append(v)
		adj[v].append(u)
	return adj

def main():
	for _ in range(iin()):
		(n, x) = ain()
		l = ain()
		l.sort()
		ans = 0
		p = -1
		i = n - 1
		count = 0
		while i >= 0:
			if p == -1:
				p = l[i]
				count = 1
			else:
				p = l[i]
				count += 1
			if p * count >= x:
				ans += 1
				p = -1
				count = 0
			i -= 1
		if p * count >= x:
			ans += 1
		print(ans)
BUFSIZE = 8192

class FastIO(IOBase):
	newlines = 0

	def __init__(self, file):
		self._fd = file.fileno()
		self.buffer = BytesIO()
		self.writable = 'x' in file.mode or 'r' not in file.mode
		self.write = self.buffer.write if self.writable else None

	def read(self):
		while True:
			b = os.read(self._fd, max(os.fstat(self._fd).st_size, BUFSIZE))
			if not b:
				break
			ptr = self.buffer.tell()
			(self.buffer.seek(0, 2), self.buffer.write(b), self.buffer.seek(ptr))
		self.newlines = 0
		return self.buffer.read()

	def readline(self):
		while self.newlines == 0:
			b = os.read(self._fd, max(os.fstat(self._fd).st_size, BUFSIZE))
			self.newlines = b.count(b'\n') + (not b)
			ptr = self.buffer.tell()
			(self.buffer.seek(0, 2), self.buffer.write(b), self.buffer.seek(ptr))
		self.newlines -= 1
		return self.buffer.readline()

	def flush(self):
		if self.writable:
			os.write(self._fd, self.buffer.getvalue())
			(self.buffer.truncate(0), self.buffer.seek(0))

class IOWrapper(IOBase):

	def __init__(self, file):
		self.buffer = FastIO(file)
		self.flush = self.buffer.flush
		self.writable = self.buffer.writable
		self.write = lambda s: self.buffer.write(s.encode('ascii'))
		self.read = lambda : self.buffer.read().decode('ascii')
		self.readline = lambda : self.buffer.readline().decode('ascii')
(sys.stdin, sys.stdout) = (IOWrapper(sys.stdin), IOWrapper(sys.stdout))
input = lambda : sys.stdin.readline().rstrip('\r\n')
main()


for _ in range(int(input())):
	(n, x) = [int(x) for x in input().split()]
	arrs = sorted([int(x) for x in input().split()], reverse=True)
	(result, curr) = (0, 1)
	for s in arrs:
		if s * curr >= x:
			result += 1
			curr = 0
		curr += 1
	print(result)


import sys
input = sys.stdin.buffer.readline

def print(val):
	sys.stdout.write(str(val) + '\n')

def prog():
	for _ in range(int(input())):
		(n, x) = map(int, input().split())
		a = list(map(int, input().split()))
		a.sort()
		teams = 0
		l = r = n - 1
		while l >= 0:
			if r - l + 1 >= x / a[l]:
				l -= 1
				r = l
				teams += 1
			else:
				l -= 1
		print(teams)
prog()


import math
x = int(input())
for i in range(x):
	(n, z) = list(map(int, input().split()))
	a = list(map(int, input().split()))
	a.sort(reverse=True)
	kk = 0
	ans = 0
	count = 1
	while kk < n:
		if a[kk] >= z:
			ans += 1
		elif a[kk] * count >= z:
			ans += 1
			count = 1
		else:
			count += 1
		kk += 1
	print(ans)


t = int(input())
for i in range(t):
	(n, x) = map(int, input().split())
	b = sorted(list(map(int, input().split())))
	ans = 0
	count = 1
	j = n - 1
	while j >= 0:
		if count * b[j] >= x:
			ans += 1
			count = 1
		else:
			count += 1
		j += -1
	print(ans)


from math import ceil
t = int(input())
for _ in range(t):
	(n, x) = list(map(lambda x: int(x), input().split()))
	a = list(map(lambda x: int(x), input().split()))
	buckets = {}
	for i in a:
		members_needed = int(ceil(x / i))
		if members_needed not in buckets:
			buckets[members_needed] = []
		buckets[members_needed].append(i)
	buckets = sorted(buckets.items(), key=lambda x: x[0])
	current_team_members = 0
	needed_team_members = 0
	total_teams = 0
	for i in range(0, len(buckets)):
		if buckets[i][0] == 1:
			total_teams += len(buckets[i][1])
			continue
		needed_team_members = buckets[i][0]
		members_in_this_bucket = len(buckets[i][1])
		if current_team_members + members_in_this_bucket >= needed_team_members:
			members_in_this_bucket = members_in_this_bucket - (needed_team_members - current_team_members)
			total_teams += 1
			if members_in_this_bucket == 0:
				current_team_members = 0
				continue
			else:
				total_teams += members_in_this_bucket // needed_team_members
				current_team_members = members_in_this_bucket % needed_team_members
				continue
		else:
			current_team_members += members_in_this_bucket
	print(total_teams)


import math
t = int(input())
for _ in range(t):
	(n, x) = map(int, input().split())
	a = list(map(int, input().split()))
	a.sort(reverse=True)
	res = 0
	c = 1
	for i in range(n):
		if a[i] * c >= x:
			c = 1
			res += 1
		else:
			c += 1
	print(res)


input_length = int(input())
while input_length != 0:
	num_string = str(input())
	(n, x) = tuple(num_string.split())
	(n, x) = (int(n), int(x))
	the_string = str(input())
	the_string_array = the_string.split()
	the_string_array = [int(x) for x in the_string_array]
	input_length -= 1
	the_string_array = sorted(the_string_array, reverse=True)
	numpeople = 0
	numgroups = 0
	for i in range(0, n):
		numpeople += 1
		curskill = numpeople * the_string_array[i]
		if curskill >= x:
			numgroups += 1
			numpeople = 0
	print(numgroups)


def solve(n, x, a):
	sorted_a = sorted(a)
	last_teams = 0
	teams = 0
	skills = []
	while len(sorted_a) >= 1 and len(sorted_a) >= len(skills):
		c = -1
		skills = []
		while abs(c) <= len(sorted_a):
			skills.append(sorted_a[c])
			if skills[-1] * len(skills) >= x:
				teams += 1
				for j in range(abs(c)):
					sorted_a.pop(-1)
				break
			else:
				c -= 1
		if last_teams == teams:
			break
		else:
			last_teams = teams
	print(teams)
t = int(input())
while t:
	(n, x) = map(int, input().split())
	a = [int(i) for i in input().split()]
	solve(n, x, a)
	t -= 1