#include <iostream>
#include <set>
#include <vector>
using namespace std;

int K, M, N;

int t;
void solve();

int main() {
    cin >> t;
    for (int tt = 0; tt < t; tt++)
        solve();
    return 0;
}

void solve() {
    cin >> K >> M >> N;
    if (M == 1) {
        cout << "No" << endl;
        return;
    }
    set<int> s;
    vector<int> ans;
    for (int i = 1; i <= K; i++) {
        int tmp1 = i, tmp2 = (i + M - 2) % K + 1;
        if (!s.contains(tmp1) && !s.contains(tmp2)) {
            s.insert(tmp1); s.insert(tmp2);
            ans.push_back(tmp1);
        } 
    }
    if (ans.size() < N)
        cout << "No" << endl;
    else {
        cout << "Yes" << endl;
        for (int i = 0; i < N; i++)
            cout << ans[i] << ((i == N - 1) ? "\n" : " ");
    } 
}