#include <bits/stdc++.h>
using namespace std;
bool isPrime(long long int n) {
  if (n <= 1) return false;
  if (n <= 3) return true;
  if (n % 2 == 0 || n % 3 == 0) return false;
  long long int p = sqrt(n);
  for (int i = 5; i <= p; i += 6)
    if (n % i == 0 || n % (i + 2) == 0) return false;
  return true;
}
string d2b(int n) {
  string s;
  for (int i = 31; i >= 0; i--) {
    int k = n >> i;
    if (k & 1)
      s += '1';
    else
      s += "0";
  }
  return s;
}
long long int gcd(long long int a, long long int b) {
  if (b == 0) return a;
  return gcd(b, a % b);
}
long long int lcm(long long int a, long long int b) {
  return (a * b) / gcd(a, b);
}
long long int b2d(string n) {
  string num = n;
  long long int dec_value = 0;
  long long int base = 1;
  long long int len = num.length();
  for (int i = len - 1; i >= 0; i--) {
    if (num[i] == '1') dec_value += base;
    base = base * 2;
  }
  return dec_value;
}
int main() {
  ios_base::sync_with_stdio(false);
  cin.tie(NULL);
  cout.tie(NULL);
  int test_case = 1;
  cin >> test_case;
  while (test_case--) {
    int n, k;
    cin >> n >> k;
    int a[n];
    for (long long i = 0; i < n; i++) cin >> a[i];
    sort(a, a + n);
    for (long long i = 1; i < n; i++) {
      a[i] = k - a[i];
    }
    int temp = a[0];
    for (long long i = 1; i < n; i++) {
      a[i] = a[i] / temp;
    }
    int s = 0;
    for (long long i = 1; i < n; i++) s += a[i];
    cout << s << endl;
  }
}
