#include<iostream>
#include<string>
#include<queue>
#include<vector>
#include<cassert>
#include<random>
#include<set>
#include<map>
#include<cassert>
#include<unordered_map>
#include<bitset>
#include<numeric>
#include<algorithm>
using namespace std;
typedef long long ll;
const int inf=1<<30;
const ll INF=1LL<<62;
typedef pair<int,ll> P;
typedef pair<int,P> PP; 
const ll MOD=998244353;
const int dy[]={0,1,0,-1};
const int dx[]={1,0,-1,0};

void solve(){
    ll K,M,N;
    cin>>K>>M>>N;

    if(M==1 || K<N){
        cout<<"No"<<endl;
        return;
    }

    set<int> st;
    int c=2*N;
    int t=1;
    bool ok=true;
    vector<int> ans;
    vector<bool> used(K+1,false);
    for(int i=1;i<=K;i++){
        
        int x=(i+M-2)%K+1;

        if(used[i] || used[x]){
            continue;
        }
        ans.push_back(i);
        used[i]=1;
        used[x]=1;
        
    }

    if(ans.size()<N){
        ok=false;
    }

    if(!ok){
        cout<<"No"<<endl;

    }else{
        cout<<"Yes"<<endl;
        for(int i=0;i<N;i++){
            cout<<ans[i]<<" ";
        }
        cout<<endl;
    }
    return;
    
}
int main(){
    int T;
    cin>>T;
    for(int t=0;t<T;t++){
        solve();
    }
}