#include<bits/stdc++.h>
using namespace std;
#define int long long
int a[100005],pos[100005],b[100005];int n;
int tp;
void solve(){
    cin>>n;
    for(int i = 1;i<=n;i++)cin>>a[i];
  // cout<<n<< endl;
    for(int i = 1;i<=n;i++)pos[a[i]] = i;
    if(tp == 0){
        int ans =0;
        for(int i = 1;i<n/2;i++)ans-=2*i;
        ans++;
        for(int i = n/2+2;i<=n;i++)ans+=2*i;
        cout<< ans<<endl;return;
    }
    int ans = n;int tot =0;
    for(int i = 1;i<=n;i++)b[i] = a[i];
    if(b[1]!=n/2+1){
        for(int i = 2;i<=n;i++){
            if(b[i] == n/2+1)tot++,swap(b[i],b[1]);
        }
    }if(b[n]!=n/2){
        for(int i = 1;i<n;i++){
            if(b[i] == n/2)tot++,swap(b[i],b[n]);
        }
    }for(int i= 1;i<=n;i+=2)if(b[i]<=n/2)tot++;
    ans = min(ans,tot);tot =0 ;
   // for(int i = 1;i<=n;i++)cin>>a[i];
   for(int i = 1;i<=n;i++)b[i] = a[i];
    if(b[1]!=n/2){
        for(int i = 2;i<=n;i++){
            if(b[i] == n/2)tot++,swap(b[i],b[1]);
        }
    }if(b[n]!=n/2+1){
        for(int i = 1;i<n;i++){
            if(b[i] == n/2+1)tot++,swap(b[n],b[i]);
        }
    }for(int i =2;i<=n;i+=2)if(b[i]<=n/2)tot++;
    ans = min(ans,tot);
    cout<<ans<<endl;
    return;
}
signed main(){
    ios::sync_with_stdio(false);
cin.tie(0);
cout.tie(0);
    int t;cin >> t >>tp;
    while(t--){
        solve();
    }
}
/*
1 1
46
16 22 11 34 20 29 25 3 26 8 21 19 27 41 15 12 23 35 32 39 46 6 33 37 10 40 13 45 36 5 43 17 42 2 1 7 30 28 44 4 14 9 38 18 31 24
*/