#include <bits/stdc++.h>
using namespace std;
#define ll long long

int main() {
    int t;
    cin >> t;
    while (t--) {  
        int n, k, cost = 0;
        cin >> n >> k;
        vector<int> a(n);
        for (int i = 0; i < n; i++) cin >> a[i];
        int i = 0, j = n - 1;
        while (i < n - 1) {
            while (j > i) { 
                int gcd = __gcd(a[i], a[j]);
                if (a[i] / gcd <= k) {
                    cost += a[i] / gcd;
                    i = j;  
                    j = n - 1; 
                    break;
                }
                j--;
            }
            if (j == i) break;
        }
        if (k == 1) {
            cout << n - 1 << endl;  
        } else {
            cout << cost << endl;
        }
    }

    return 0;
}