#include<bits/stdc++.h>
using namespace std;
#define int long long
const int N = 1e6+10;

int n, m;
void solve() {
	cin >> n >> m;
	int k;
	cin >> k;
	vector<vector<int >> a(n + 1, vector<int>(m + 1));
	vector<int> idx(n * m + 1);
	for (int i = 1; i <= n * m; i++) {
		int x;
		cin >> x;
		idx[x] = i;
	}
	if (k >= m) {
		cout << m << endl;
		return;
	}
	int res = n * m;
	for (int i = 1; i <= n; i++) {
		priority_queue<int> q;
		for (int j = 1; j <= m; j++) {
			q.push(idx[((i - 1)*m + j)]);
		}
		int temp = k;
		while (temp--)q.pop();
		res = min(res, q.top());
	}
	cout << res << endl;
}
signed main() {
	ios::sync_with_stdio(false);
	cin.tie(0);
	cout.tie(0);
	int t = 1;
	cin >> t;
	while (t--)solve();
}