#include <bits/stdc++.h>

using i64 = long long;
using u64 = unsigned long long;
using u32 = unsigned;
using u128 = unsigned __int128;

void solve() {
    int M, N, K;
    std::cin >> M >> N >> K;
    
    std::set<int> avai;
    for (int i = 0; i < N; i++) {
        avai.insert(i);
    }
    
    std::vector<std::string> name(N);
    std::vector<int> level(N);
    
    std::map<std::pair<std::string, int>, std::vector<int>> pos;
    
    for (int i = 0; i < M; i++) {
        std::string s;
        std::cin >> s;
        
        if (pos.contains({s, 3})) {
            continue;
        }
        
        int l = 1;
        while (l < 3 && pos.contains({s, l}) && pos[{s, l}].size() == K - 1) {
            for (auto j : pos[{s, l}]) {
                name[j] = "";
                level[j] = 0;
                avai.insert(j);
            }
            pos[{s, l}].clear();
            l++;
        }
        
        if (!avai.empty()) {
            int j = *avai.begin();
            name[j] = s;
            level[j] = l;
            avai.erase(j);
            pos[{s, l}].push_back(j);
        }
    }
    
    for (int i = 0; i < N; i++) {
        if (name[i].empty()) {
            std::cout << -1;
        } else {
            std::cout << name[i];
            if (level[i] > 1) {
                std::cout << level[i];
            }
        }
        std::cout << " \n"[i == N - 1];
    }
}

int main() {
    std::ios::sync_with_stdio(false);
    std::cin.tie(nullptr);
    
    int t;
    std::cin >> t;
    
    for (int i = 1; i <= t; i++) {
        std::cout << "Case " << i << ": ";
        solve();
    }
    
    return 0;
}