t = int(input())
def find(x, i):
ans = 1
while x < i:
x = x * 2
ans += 1
return ans, i*2
for _ in range(t):
n, x = map(int, input().split())
s = list(map(int , input().split()))
s.sort()
if s.count(s[0]) == n:
a, b = find(x, s[0])
print(a + n-1)
continue
ind = -1
count = 0
for i in range(len(s)):
if x<= s[i]:
ind = i
break
if ind==-1:
print(n)
continue
if ind!=0:
ind-=1
for i in range(ind, len(s)):
if s[i] * 2 <= x:
count+=1
continue
b, x = find(x, s[i])
count+=b
print(count + ind)
287. Find the Duplicate Number | 279. Perfect Squares |
275. H-Index II | 274. H-Index |
260. Single Number III | 240. Search a 2D Matrix II |
238. Product of Array Except Self | 229. Majority Element II |
222. Count Complete Tree Nodes | 215. Kth Largest Element in an Array |
198. House Robber | 153. Find Minimum in Rotated Sorted Array |
150. Evaluate Reverse Polish Notation | 144. Binary Tree Preorder Traversal |
137. Single Number II | 130. Surrounded Regions |
129. Sum Root to Leaf Numbers | 120. Triangle |
102. Binary Tree Level Order Traversal | 96. Unique Binary Search Trees |
75. Sort Colors | 74. Search a 2D Matrix |
71. Simplify Path | 62. Unique Paths |
50. Pow(x, n) | 43. Multiply Strings |
34. Find First and Last Position of Element in Sorted Array | 33. Search in Rotated Sorted Array |
17. Letter Combinations of a Phone Number | 5. Longest Palindromic Substring |