#include <bits/stdc++.h>
using namespace std;

#define pii pair<int, int>
#define ft first
#define sd second

const int oo = 2e5 + 3;

int n, k;
int a[oo];

pii update(int max1, int max2, int d) {
	if (max1 < d) {
		max2 = max1;
		max1 = d;
	} else if (d > max2) {
		max2 = d;
	}
	
	return {max1, max2};
}

void solve() {
	cin >> n >> k;
	for (int i = 1; i <= n; ++i) {
		cin >> a[i];
	}
	
	int last_pos[n + 1];
	pii val[n + 1];
	
	for (int i = 1; i <= n; i++) {
		last_pos[i] = 0;
		val[i] = {-oo, -oo};
	}
	
	for (int i = 1; i <= n; i++) {
		int d = i - last_pos[a[i]] - 1;
		val[a[i]] = update(val[a[i]].ft, val[a[i]].sd, d);
		
		last_pos[a[i]] = i;
	}
	
	for (int i = 1; i <= k; i++) {
		int d = (n + 1) - last_pos[i] - 1;
		val[i] = update(val[i].ft, val[i].sd, d);
	}
	
	int res = oo;
	for (int i = 1; i <= k; i++) {
		int new_val = val[i].ft / 2;
		new_val = max(new_val, val[i].sd);
		
		res = min(res, new_val);
	}
	
	cout << res << "\n";
}

int main() {
	
	int t;
	cin >> t;
	while (t--) {
		solve();
	}
	
	return 0;
}