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

ll gcd_(ll a, ll b) {
    return b==0? a : gcd_(b, a%b);
}

void solve() {
    ll n,k;
    cin>>n>>k;
    vector<ll> arr(n);

    for (ll i=0; i<n; i++) {
        cin>>arr[i];
    }
    vector<ll> dp(n, LLONG_MAX);

    dp[n-1]=0;

    for (ll i =n-2; i>=0; i--) {
        dp[i] = min(dp[i], k + dp[i + 1]);

        for (ll j = i + 1; j < n; j++) {
            ll cost = arr[i] / gcd_(arr[i], arr[j]);
            dp[i] = min(dp[i], cost + dp[j]);
        }
    }
    cout << dp[0] << endl;
}

int main(){
    int t;
    cin>>t;
    while(t--){
        solve();
    }
return 0;
}