#include <bits/stdc++.h>

using i64 = long long;

void solve() {
    int n, k, m;
    std::cin >> n >> k >> m;
    
    std::vector<int> a(n);
    for (int i = 0; i < n; i++) {
        std::cin >> a[i];
        a[i]--;
    }
    
    std::vector<int> have(k), happy(n);
    for (int i = 0; i < 2 * n; i++) {
        int x = i % n;
        happy[x] += have[a[x]];
        have[a[x]] ^= 1;
    }
    for (int i = 0; i < n; i++) {
        happy[i] *= m / (2 * n);
    }
    for (int i = 0; i < m % (2 * n); i++) {
        int x = i % n;
        happy[x] += have[a[x]];
        have[a[x]] ^= 1;
    }
    for (int i = 0; i < n; i++) {
        std::cout << happy[i] << " \n"[i == n - 1];
    }
}

int main() {
    std::ios::sync_with_stdio(false);
    std::cin.tie(nullptr);
    
    int t;
    std::cin >> t;
    
    while (t--) {
        solve();
    }
    
    return 0;
}