#include <bits/stdc++.h>
using namespace std;
long long max(long long a, long long b) {
  if (a > b)
    return a;
  else
    return b;
}
const int MOD = 1000000007;
int no_of_bits(long long n) {
  int count = 0;
  while (n > 0) {
    n = n >> 1;
    count++;
  }
  return count;
}
long long gcd(int a, int b) {
  if (b == 0)
    return a;
  else
    return gcd(b, a % b);
}
void printFrequency(vector<int> v) {
  unordered_map<int, int> M;
  for (int i = 1; i < (int)v.size(); i++) {
    if (M.find(v[i]) == M.end()) {
      M.insert(make_pair(v[i], 1));
    } else {
      M[v[i]]++;
    }
  }
}
void add_self(int &a, int b) {
  a += b;
  if (a >= MOD) {
    a -= MOD;
  }
}
void sub_self(int &a, int b) {
  a -= b;
  if (a < 0) {
    a += MOD;
  }
}
int search(vector<int> x, int n, int i) {
  int l = 0, h = n - 1, mid;
  while (l <= h) {
    mid = (l + h) / 2;
    if (x[mid] < i) {
      l = mid + 1;
    } else {
      h = mid - 1;
    }
  }
  return l;
}
bool check9(string s) {
  for (int i = 0; i < (int)s.size(); i++)
    if (s[i] != '9') return 0;
  return 1;
}
bool comparator(const pair<long long, int> &a, const pair<long long, int> &b) {
  if (a.first > b.first)
    return 1;
  else if (a.first < b.first)
    return 0;
  else {
    if (a.second < b.second)
      return 1;
    else
      return 0;
  }
}
const int INF = -2000;
const long long INF_ = 1e13;
void solve() {
  long long n, x;
  cin >> n >> x;
  vector<long long> v(n);
  for (int i = 0; i < n; i++) {
    cin >> v[i];
  }
  sort(v.begin(), v.end());
  long long ans = 0, store = n - 1;
  for (int i = n - 1; i >= 0; i--) {
    if (v[i] * (store - i + 1) >= x) {
      ans++;
      store = i - 1;
    }
  }
  cout << ans << endl;
}
int main() {
  ios::sync_with_stdio(0);
  cin.tie(0);
  cout.tie(0);
  int t;
  cin >> t;
  while (t--) {
    solve();
  }
}
