http://dmnotdm.cn/problem.php?id=1015
#include<algorithm>
#include<iostream>
#include<fstream>
#include<cstring>
#include<cstdio>
#include<cmath>
#include<ctime>
using namespace std;
int n,m,mid;
long long ans,tmp,a[200001],dis;
void input()
{
cin>>n>>m;
int i;
for(i=1;i<=n;i++)
cin>>a[i];
}
void compile()
{
sort(a,a+n+1);
int i;
dis=ans=tmp=0;
for(i=1;i<=n;i++)
a[i+n]=a[i]+m;
mid=n/2;
if(n%2==1)
{
mid++;
dis=1;
}
for(i=1;i<=n;i++)ans+=abs(a[i]-a[mid]);
tmp=ans;
for(i=1;i<=n;i++)
{
mid++;
tmp+=(a[mid]-a[mid-1])*dis-a[mid]+a[i]+(a[i+n]-a[mid]);
ans=min(tmp,ans);
}
}
void output()
{
cout<<ans<<endl;
}
int main()
{
ios::sync_with_stdio(false);
int t;
cin>>t;
while(t--)
{
input();
compile();
output();
}
return 0;
}