#include<bits/stdc++.h>
using namespace std;
using ll = long long;
using ull = unsigned long long;
constexpr int MOD=998244353;
#define rep(i,n) for(int i=0;i<(int)(n);i++)

void solve();
int main(){
  ios::sync_with_stdio(false);
  cin.tie(nullptr);
  int test_case;
  cin>>test_case;
  while (test_case--){
    solve();
  }
}
void solve(){
  int K,M,N;
  cin>>K>>M>>N;
  if(M==1){
    cout<<"No\n";
    return;
  }
  bool frev=0;
  vector ans(0,0),used(K,0);
  int idx=0;
  for(int idx=0;idx<K&&(int)ans.size()<N;idx++){
    if(used[idx])continue;
    int idxl=idx,idxr=(idx+M-1)%K;
    while((!used[idxl])&&(!used[idxr])){
      ans.push_back(idxl+1);
      used[idxl]=1,used[idxr]=1;
      idxl=(idxr+M-1)%K;
      idxr=(idxl+M-1)%K;
    }
  }
  if((int)ans.size()<N){
    cout<<"No\n";
    return;
  }
  cout<<"Yes\n";
  for(int i=0;i<N;i++){
    if(i)cout<<' ';
    cout<<ans[i];
  }
  cout<<'\n';
}