#include <bits/stdc++.h>
using namespace std;
int t, x, a[100005], b[100005],  name[200005], ccnt, n, c[100005], l, r, ll, rr, ans, cnt;
vector<int> son[100005];
inline void build() {
	b[n / 2] = 1;
	if (n == 2) {
		b[2] = 2;
		return;
	}
	b[n / 2 + 1] = n;
	b[n / 2 - 1] = n - 1;
	l = 2, r = n - 2;
	ll = n / 2 - 1, rr = n / 2 + 1;
	int flg = 1;
	for (int i = 2; i <= r; i++) {
//		cout << i << '|' << flg << endl;
		if (flg) {
			b[++rr] = i;
			l = i + 1;
			if (r > l) {
				b[++rr] = r;
				r--;
			}
		} else {
			b[--ll] = i;
			l = i + 1;
			if (r > l) {
				b[--ll] = r;
				r--;
			}
		}
		flg = !flg;
	}
}
inline void color(int p, int q) {
//	cout << p << " " << q << "@@\n";
	name[p] = q;
	for (int i = 0; i < son[p].size(); i++) {
		if (name[son[p][i]]) continue;
		color(son[p][i], q);
	}
}
inline void solve() {
	int ct = 0;
	for (int i = 1; i <= n; i++) {
		if (b[i] == a[i]) ct++;
//		cout << b[i] << ' ';
		name[i] = 0, son[i].clear();
	}
//	cout << endl;
	for (int i = 1; i <= n; i++) {
		if (a[i] != b[i]) {
			son[a[i]].push_back(b[i]);
			son[b[i]].push_back(a[i]);
		}
	}
	for (int i = 1; i <= n; i++) {
		if (a[i] != b[i] && !name[ a[i]]) {
			color(a[i], ++ct);
		}
	}
	ans = min(ans, n - ct);
}
signed main() {
	ios::sync_with_stdio(0);
	cin.tie(0);
	cout.tie(0);
	cin >> t >> x;
	while (t--) {
		cin >> n;
		for (int i = 1; i <= n; i++) {
			cin >> a[i];
		}
		build();
		if (x == 0) {
			long long ans = 0;
			for (int i = 1; i < n; i++) {
				ans += abs(b[i + 1] - b[i]);
			}
			cout << ans << "\n";
		} else {
			ans = 0x3f3f3f3f;
			cnt = 0;
			for (int i = 1; i <= n; i++) c[i] = a[i];
			if (c[1] != n / 2) {
				for (int i = 2; i <= n; i++) if (c[i] == n / 2) c[i] = c[1];
				c[1] = n / 2;
				cnt++;
			}
			if (c[n] != n / 2 + 1) {
				for (int i = 1; i <= n - 1; i++) if (c[i] == n / 2 + 1) c[i] = c[n];
				c[n] = n / 2 + 1;
				cnt++;
			}
			for (int i = 2; i < n; i += 2) {
				if (c[i] < n / 2) cnt++;
			}
			ans = min(ans, cnt);
			cnt = 0;
			for (int i = 1; i <= n; i++) c[i] = a[i];
			if (c[1] != n / 2 + 1) {
				for (int i = 2; i <= n; i++) if (c[i] == n / 2 + 1) c[i] = c[1];
				c[1] = n / 2 + 1;
				cnt++;
			}
			if (c[n] != n / 2 ) {
				for (int i = 1; i <= n - 1; i++) if (c[i] == n / 2 ) c[i] = c[n];
				c[n] = n / 2;
				cnt++;
			}
			for (int i = 3; i < n; i += 2) {
				if (c[i] < n / 2) cnt++;
			}
			ans = min(ans, cnt);
			cout << ans << "\n";
		}
	}
}
//1 0
//44
//22 39 6 35 15 27 21 37 9 33 1 25 17 40 12 29 7 44 2 24 14 30 13 31 10 26 4 32 3 41 11 34 19 38 18 42 8 28 23 43 20 36 16 5