#include<bits/stdc++.h>
using namespace std;
#define ll long long int 
ll dp[200004];
ll ar[200004];
ll n,k;
ll ok(ll i)
{
    if(i>=n-1)
        return 0;
 
    if(dp[i]!=-1) return dp[i];
       ll op=INT_MAX;
    for(int j=i+1;j<n;j++)
    {
        ll u=(j-i)*k;
        op=min({op,u+ok(j),(ar[i]/__gcd(ar[i],ar[j]))+ok(j)});
        
    }
    return dp[i]=op;
}
int main()
{
    ll tc;
    cin>>tc;
    while(tc--)
    {
       cin>>n>>k;
        
        for(int i=0;i<=n;i++){
            dp[i]=-1;
            ar[i]=0;
        }
        for(int i=0;i<n;i++)
            cin>>ar[i];
        ll op=ok(0);
        cout<<op<<endl;
        
        

    }
}