#include <iostream>
#include <vector>
using namespace std;
const int N = 1e5 + 10;
int n, k, m,w[N],ans[N];
vector<int>a[N];
void solve() {
	cin >> n >> k >> m;
	for (int i = 0; i <=k; i++)
		a[i].clear();
	for (int i = 0; i <n; i++) {
		cin >> w[i];
		a[w[i]].push_back(i);
		ans[i] = 0;
	}
	for (int i = 1; i <= k; i++) {
		if (a[i].empty())continue;
		else if (a[i].size()&1) {
			for (int j = 0; j < a[i].size(); j++) {
				int idx = a[i][j];
				ans[idx] = m / n / 2 + ((m / n & 1) && (m % n > idx));
			}
		}
		else {
			for (int j = 1; j < a[i].size(); j += 2) {
				int idx = a[i][j];
				ans[idx] = m / n + ((m / n & 1) && (m % n >idx));
			}
		}
	}
	for (int i = 0; i < n; i++) {
		cout << ans[i];
		if (i != n - 1)
			cout << " ";
	}
	cout << "\n";
}
int main() {
	int t;
	cin >> t;
	while (t--)
		solve();
}