#include <bits/stdc++.h>
#include <atcoder/all>
using ll = long long;
#define MOD 1000000007
#define Mod 998244353
const int MAX = 1000000005;
const long long INF = 1000000000000000005LL;
using namespace std;
using namespace atcoder;

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

int main() {
    ios::sync_with_stdio(0);cin.tie();
    int T;
    cin >> T;
    while (T--) {solve();}
}