B
#include <bits/stdc++.h>
using namespace std;
const int N = 1e6+10;
typedef long long LL;
int test=1;
int n,a[N];
LL sum,k;
int maxn;
int main()
{
scanf("%d",&test);
while(test--)
{
sum = k = 0;
maxn = 0;
cin >> n;
for(int i=0;i<n;i++)
{
scanf("%d",&a[i]);
sum += a[i];
maxn = max(a[i],maxn);
}
k = max(1LL*maxn, (sum+n-2)/(n-1));
cout << k*(n-1)-sum << '\n';
}
return 0;
}