func_code_string: #include <bits/stdc++.h>   using namespace std;   bool sBs(const pair<int, int> &a, const pair<int, int> &b) {     return (a.second < b.second);   }   long long SUMD(long long n);   long long BS(vector<pair<long long, long long> > &PS, long long s, long long e,                long long ser);   long long MI(long long a, long long m);   long long P[101LL + 1];   void Sieve(int n = 101LL);   long long Powb(long long b, long long n, long long m);   int main() {     ios::sync_with_stdio(false);     cin.tie(0);     cout.tie(0);     ;     long long q = 1, t;     cin >> q;     t = q;     while (q--) {       long long i, j, n, m, k, l = 0, r = 0, a = 0, b = 0, c = 0, d = 0, e, g = 1,                                p, u, v, w, x, y, flag = 1;       cin >> n >> x;       long long ans = 0;       vector<long long> V(n);       for (i = 0; i < n; i++) cin >> V[i];       sort(V.rbegin(), V.rend());       for (i = 0; i < n; i++) {         if (V[i] * (i - l + 1) >= x) {           ans += 1;           l = i + 1;         }       }       cout << ans <<   n ;     }     return 0;   }   long long Powb(long long b, long long n, long long m) {     if (n == 0) return 1LL;     if (n == 1) return b;     long long temp = Powb(b, n / 2, m);     if (n % 2 == 0) {       return (temp * temp) % m;     } else {       return (b * ((temp * temp) % m)) % m;     }   }   long long SUMD(long long n) {     long long sum = 0;     while (n > 0) {       sum += n % 10;       n = n / 10;     }     return sum;   }   long long BS(vector<pair<long long, long long> > &PS, long long s, long long e,                long long ser) {     if (s > e) return s;     long long mid = (s + e) / 2;     if (PS[mid].first == ser) {       return mid;     } else if (PS[mid].first > ser) {       return BS(PS, s, mid - 1, ser);     } else       return BS(PS, mid + 1, e, ser);   }   long long MI(long long a, long long m) {     long long m0 = m;     long long y = 0, x = 1;     if (m == 1) return 0;     while (a > 1) {       long long q = a / m;       long long t = m;       m = a % m, a = t;       t = y;       y = x - q * y;       x = t;     }     if (x < 0) x += m0;     return x;   }   void Sieve(int n) {     for (int i = 1; i <= n; i++) P[i] = i;     for (long long i = 2; i * i <= n; i++) {       if (P[i] == i) {         for (long long j = i * i; j <= n; j += i) {           if (P[j] == j) P[j] = i;         }       }     }   }   