#include <bits/stdc++.h>
using namespace std;
using ll=long long;
using ull=unsigned long long;
using pll=pair<ll,ll>;
using tll=tuple<ll,ll,ll>;
using ld=long double;
const ll INF=(1ll<<60);
#define rep(i,n) for (ll i=0;i<(ll)(n);i++)
#define replr(i,l,r) for (ll i=(ll)(l);i<(ll)(r);i++)
#define all(v) v.begin(),v.end()
#define len(v) ((ll)v.size())
template<class T> inline bool chmin(T &a,T b){
    if(a>b){
        a=b;
        return true;
    }
    return false;
}
template<class T> inline bool chmax(T &a,T b){
    if(a<b){
        a=b;
        return true;
    }
    return false;
}
int main(){
    ios::sync_with_stdio(false);
    cin.tie(nullptr);
    bitset<200000> b;
    ll t;
    cin >> t;
    mt19937 mt;
    while(t--){
        ll k,m,n;
        cin >> k >> m >> n;
        m--;
        set<ll> st;
        vector<ll> ans;
        vector<ll> ord(k);
        rep(i,k) ord[i]=i;
        rep(_,100){
            shuffle(all(ord),mt);
            b.reset();
            vector<ll> now;
            for(auto i:ord){
                ll j=(i+m)%k;
                if(!b[i]&&!b[j]&&i!=j){
                    b[i]=1;
                    b[j]=1;
                    now.push_back(i);
                }
            }
            if(len(ans)<len(now)) ans=now;
        }
        if(n<=len(ans)){
            cout << "Yes\n";
            rep(i,n) cout << ans[i]+1 << ' ';
            cout << '\n';
        }else{
            cout << "No\n";
        }
    }
}