// 

#include <bits/stdc++.h>
using namespace std;

using ll = long long;

#define rep(i, n) for (int i=0; i<(int)(n); ++(i))
#define rep3(i, m, n) for (int i=(m); (i)<(int)(n); ++(i))
#define repr(i, n) for (int i=(int)(n)-1; (i)>=0; --(i))
#define rep3r(i, m, n) for (int i=(int)(n)-1; (i)>=(int)(m); --(i))
#define all(x) (x).begin(), (x).end()

const int INF = (int)(1e9);

int main() {
    int t0;
    cin >> t0;
    rep(i0, t0) {
        int k, m, n;
        cin >> k >> m >> n;
        if ((1+m-2)%k+1 == 1) {
            cout << "No" << endl;
            continue;
        }
        vector<int> res;
        unordered_set<int> st;
        rep3(i, 1, k+1) st.insert(i);
        rep3(i, 1, k+1) {
            int bi = (i+m-2)%k+1;
            if (st.find(i) != st.end() && st.find(bi) != st.end()) {
                res.push_back(i);
                st.erase(i);
                st.erase(bi);
            }
            if ((int)res.size() == n) break;
        }
        if ((int)(res.size()) < n) cout << "No" << endl;
        else {
            cout << "Yes" << endl;
            rep(i, n) cout << res[i] << (i<n-1?' ':'\n');
        }
    }
    return 0;
}