#include <bits/stdc++.h>
using namespace std;
vector<long long> v;
pair<long long, long long> p;
map<long long, long long> mp;
set<long long> st;
deque<long long> dq;
priority_queue<long long> pq;
long long mn = INT_MAX, mx = INT_MIN;
long long n, m, tc, i, j, tmp, sum, cn, ans, res, pos, flag, l, x;
string s;
long long a[200007], b[200007];
int main() {
  ios_base::sync_with_stdio(0);
  cin.tie(0);
  cout.tie(0);
  cin >> tc;
  while (tc--) {
    cn = 0;
    res = 0;
    cin >> n >> x;
    for (i = 0; i < n; i++) cin >> a[i];
    sort(a, a + n);
    for (i = n - 1; i >= 0; i--) {
      res++;
      if (res * a[i] >= x) {
        res = 0;
        cn++;
      }
    }
    cout << cn << endl;
  }
  return 0;
}
