#include <bits/stdc++.h>
using namespace std;
void test_case();
long long power(int n, int p);
int main() {
  ios_base::sync_with_stdio(0);
  cin.tie(0);
  cout.tie(0);
  int t;
  cin >> t;
  while (t--) {
    test_case();
  }
  return 0;
}
void test_case() {
  int n, x;
  cin >> n >> x;
  vector<int> arr(n);
  for (int i = 0; i < n; i++) cin >> arr[i];
  sort(arr.begin(), arr.end());
  int teams = 0;
  int cnt = 1;
  for (int ptr = n - 1; ptr >= 0; ptr--) {
    if (arr[ptr] * cnt >= x) {
      teams++;
      cnt = 1;
    } else
      cnt++;
  }
  cout << teams << '\n';
}
long long power(int n, int p) {
  long long ans = 1;
  if (p == 0) return 1;
  long long temp = power(n, p / 2);
  if (p % 2 == 0)
    ans = (temp * temp) % 1000000007;
  else {
    ans = (ans * n) % 1000000007;
    ans *= (temp * temp) % 1000000007;
  }
  return ans;
}
