#include<bits/stdc++.h>
using namespace std;
int a[100005],b[100005];
int main(){
//	freopen("tree.in","r",stdin);
//	freopen("tree.out","w",stdout);
	int T,n,x;
	scanf("%d%d",&T,&x);
	while(T--){
		scanf("%d",&n);
		for(int i=1;i<=n;i++)scanf("%d",&a[i]);
		if(x==0){
			printf("%lld\n",1LL*n*(n+1)-2LL*(n/2)*(n/2+1)-1);
			continue;
		}
		int p1=0,p2=0;
		for(int i=1;i<=n;i++){
			if(a[i]==n/2)p1=i;
			if(a[i]==n/2+1)p2=i;
		}
		int o1=p1,o2=p2;
		int ans1=0,ans2=0;
		//1
		for(int i=1;i<=n;i++)b[i]=a[i];
		if(p1!=1){
			if(b[1]==n/2+1)p2=p1;
			swap(b[1],b[p1]);
			ans1++;
		}
		if(p2!=n){
			swap(b[n],b[p2]);
			ans1++;
		}
		for(int i=2;i<n;i+=2)if(b[i]<=n/2)ans1++;
		//2
		p1=o1,p2=o2;
		for(int i=1;i<=n;i++)b[i]=a[i];
		if(p1!=n){
			if(b[n]==n/2+1)p2=p1;
			swap(b[n],b[p1]);
			ans2++;
		}
		if(p2!=1){
			swap(b[1],b[p2]);
			ans2++;
		}
		for(int i=2;i<n;i+=2)if(b[i]>n/2)ans2++;
		//02003
		printf("%d\n",min(ans1,ans2));
	}
	return 0;
}