#include <bits/stdc++.h>
#define arr(i,n) for(ll i=0;i<n;i++)
#define ARR(i,n) for(ll i=n-1;i>=0;i--)
#define f(i,a,b)  for(ll i=a;i<b;i++)
#define F(i,a,b)  for(ll i=b-1;i>=a;i--)
#define float double
#define PI 3.14159265358979323846
#define pb push_back
#define mp make_pair
#define vi vector<ll>
#define ceil(a,b) ceil(a*1.0/b)
#define vpii vector< pair<ll,ll> >
#define debug(x) cout<<(#x)<<" is "<<(x)<<endl
#define gcd(a,b) __gcd(a,b)
#define lcm(a,b) (a*(b/gcd(a,b)))
#define all(v) v.begin(),v.end()
#define inputarr(a,n) for(ll i=0;i<n;++i) cin>>a[i]
#define integer_to_string to_string 
#define IOS  ios::sync_with_stdio(0); cin.tie(0); cout.tie(0)
typedef long long ll;
using namespace std;
const ll  mod = 1000000000 + 7;
void solve()
{
    //code start here
    ll n,x;
    cin>>n>>x;
    ll mini=INT_MAX;
    ll a[n],id=0,res=0;
    arr(i,n)
    {
        cin>>a[i];
        res+=a[i];
        ll temp=a[i],cnt=0;
        while(temp%x==0) {cnt++; temp/=x;}
        if(mini>cnt) {id=i; mini=cnt;}
    }
    ll ans=(mini+1)*res;
    res=0;
    arr(i,id) res+=a[i]; 
    cout<<ans+res<<endl;
}
int main()
{
    int t;
    cin>>t;
    while(t--)
      solve();
    return 0;
}