#include<bits/stdc++.h>
using namespace std;
void work(){
    int n,k,m;
    cin>>n>>k>>m;
    vector<int> a(n,0);
    map<int,int> mp;
    for (int i = 0; i < n; ++i) {
        cin>>a[i];
    }
    vector<vector<int>> same(k+1);
    for(int i=0;i<n;i++){
        same[a[i]].push_back(i);
    }
    int cir=m/n,lst=m%n;
    vector<int> ans(n,0);
    for(int i=1;i<=k;i++){
        if(same[i].size()%2==0){
            for(int j=1;j<same[i].size();j+=2){
                ans[same[i][j]]+=cir;
            }
        }else{
            for(auto &j:same[i]){
                ans[j]+=cir/2;
            }
            int rst=cir%2;
            for(int j=1;j<same[i].size();j+=2){
                ans[same[i][j]]+=rst;
            }
            if(rst)mp[i]=1;
        }

    }
    for(int i=0;i<lst;++i){
        if(mp[a[i]]==0){
            mp[a[i]]=1;
        }else{
            ans[i]++;
            mp[a[i]]=0;
        }
    }
    for(int i=0;i<n-1;i++){
        cout<<ans[i]<<' ';
    }
    cout<<ans[n-1]<<endl;
}
int main(){
    int t;
    cin>>t;
    while(t--)work();
}
//
// Created by johntime on 24-5-9.
//