#include<bits/stdc++.h>
#define int long long
using namespace std;
const int N = 1e6 + 5;
int n, k, m;
void solve()
{
   cin >> n >> k >> m;
    vector<int> cnt(2*n+5);
    vector<int> man(2*n+5);
    vector<int> a(2*n + 5);


    
    
    for (int i = 0; i < n; i++)
    {
        cin >> a[i];
        
    }
    int y = m / (n*2);
    if (y >= 1)
    {
        for (int i = 0; i < n * 2; i++)
        {

             if (cnt[a[i%n]] == 0) cnt[a[i%n]]++;
             else
             {
                cnt[a[i%n]]--;
                man[i%n]++;
             }
        }
        for (int i = 0; i < n; i++)
        {
            man[i] = man[i] * y;
        }


    }
    int u = m % (n*2);
    for (int i = 0; i < u; i++)
    {

        if (cnt[a[i % n]] == 0) cnt[a[i % n]]++;
        else
        {
            cnt[a[i % n]]--;
            man[i % n]++;
        }
    }

    

    for (int i = 0; i < n; i++)
    {
        if(i==0) cout << man[i];
        else  cout <<" "<< man[i];
    }
    cout << endl;
}
signed main()
{
    ios::sync_with_stdio(0);
    cin.tie(0);
    cout.tie(0);
    int t;
    cin >>t;
    while (t--)solve();
    return 0;
}