#pragma GCC optimize("Ofast")
#pragma GCC optimize("O3")
#pragma GCC optimize("unroll-loops")
#include <bits/stdc++.h>
using namespace std;
#define int long long
#define ld long double
#define pb push_back
#define f first
#define s second
const int N = 2e5 + 5;
vector <int> divs[N];
void sieve (int n) {
    for (int i = 1; i <= n; ++i) {
        for (int j = i; j <= n; j += i) {
            divs[j].pb(i);
        }
    }
}
void solve () {
    int n, k;
    cin >> n >> k;
    int a[n + 1];
    for (int i = 1; i <= n; ++i) {
        cin >> a[i];
    }
    int dp[n + 1] = {};
    vector <int> mn(N, 1e18);
    for (int d : divs[a[1]]) {
        mn[d] = min(mn[d], dp[1] + a[1] / d);
    }
    for (int i = 2; i <= n; ++i) {
        dp[i] = dp[i - 1] + k;
        for (int d : divs[a[i]]) {
            dp[i] = min(dp[i], mn[d]);
        }
        for (int d : divs[a[i]]) {
            mn[d] = min(mn[d], dp[i] + a[i] / d);
        }
    }
    cout << dp[n] << endl;
}
signed main() {
    ios_base::sync_with_stdio(0);
    cin.tie(0);
    cout.tie(0);
    sieve(N - 1);
    int t = 1;
    cin >> t;
    while (t--) {
        solve();
    }

    return 0;
}