http://acm.hdu.edu.cn/showproblem.php?pid=6709
#include <iostream>
#include <cstring>
#include <queue>
#include <vector>
#include <algorithm>
#include <cstdio>
#include <set>
#include <map>
#include <cmath>
#include <stack>
//#include<bits/stdc++.h>
using namespace std;
#define sfi(i) scanf("%d",&i)
#define sfl(i) scanf("%I64d",&i)
#define sfs(i) scanf("%s",(i))
#define pri(i) printf("%d\n",i)
#define prl(i) printf("%I64d\n",i)
#define sff(i) scanf("%lf",&i)
#define ll long long
#define ull unsigned long long
#define mem(x,y) memset(x,y,sizeof(x))
#define INF 0x3f3f3f3f
#define eps 1e-10
#define PI acos(-1.0)
#define lowbit(x) ((x)&(-x))
#define fl() printf("flag\n")
#define MOD(x) ((x%mod)+mod)%mod
#define endl '\n'
#define pb push_back
#define lson (rt<<1)
#define rson (rt<<1|1)
#define FAST_IO ios::sync_with_stdio(false);cin.tie(0);cout.tie(0)
const int maxn=1e5+9;
int a[maxn];
int main()
{
//FAST_IO;
//freopen("input.txt","r",stdin);
int T;
cin>>T;
while(T--)
{
int n,k;
cin>>n>>k;
for(int i=0;i<n;i++) cin>>a[i];
int num=1;
for(int i=0;i<n;i++)
{
num+=a[i]/k;
}
ll ans=0;
ans+=k;
for(int i=0;i<n;i++) ans+=(ll)a[i];
if(num<n)
{
for(int i=0;i<n;i++) a[i]=a[i]%k;
sort(a,a+n,greater<int>());
for(int i=0;i<n;i++)
{
if(num==n)
{
break;
}
else
{
num++;
ans+=k-a[i];
}
}
}
cout<<ans<<endl;
}
return 0;
}