#include <bits/stdc++.h>

void dfs(
    int v,
    bool selected,
    std::vector<std::vector<int>> &G,
    std::vector<bool> &visited,
    std::vector<int> &selection
){
    visited[v] = true;

    bool proceeded = false;
    for(int w : G[v]){
        if(!visited[w]){
            dfs(w, !selected, G, visited, selection);
            proceeded = true;
        }
    }

    if(selected && proceeded){
        selection.emplace_back(v);
    }
}

int main(){
    std::cin.tie(nullptr);
    std::ios::sync_with_stdio(false);

    int T;
    std::cin >> T;

    for(int _=0;_<T;_++){
        int K, M, N;
        std::cin >> K >> M >> N;

        std::vector<std::vector<int>> G(K + 1);
        for(int i=1;i<=K;i++){
            int j = (i + M - 2) % K + 1;
            G[i].emplace_back(j);
            G[j].emplace_back(i);
        }

        std::vector<bool> visited(K + 1, 0);
        std::vector<int> selection;
        for(int i=1;i<=K;i++){
            if(!visited[i]){
                dfs(i, true, G, visited, selection);
            }
        }

        if(selection.size() >= N){
            std::cout << "Yes" << std::endl;
            for(int i=0;i<N;i++){
                std::cout << selection[i] << " \n"[i + 1 == N];
            }
        }else{
            std::cout << "No" << std::endl;
        }
    }
}