#include <bits/stdc++.h>
#include <atcoder/dsu>
#pragma GCC optimize("Ofast")
#pragma GCC optimize("unroll-loops")
using namespace std;
int main() {
  cin.tie(0); cout.tie(0);
  ios::sync_with_stdio(false);
  int T;
  cin >> T;
  while(T--) {
    int K, M, N;
    cin >> K >> M >> N;
    if(2 * N > K || M == 1) {
      cout << "No\n";
    } else {
      vector<int> G(K);
      for(int i = 0; i < K; i++) {
        int j = (i + M - 1) % K;
        G[i] = j;
      }
      vector<bool> seen(K, false);
      vector<vector<int>> H;
      vector<int> ans;
      for(int i = 0; i < N; i++) {
        int cnt = 0;
        int now = i;
        if(!seen[i]) {
          vector<int> v;
          while(!seen[now]) {
            cnt++;
            v.emplace_back(now);
            seen[now] = true;
            now = G[now];
          }
          if(v.size() / 2) {
            v.pop_back();
          }
          for(int i = 0; i < (int) v.size(); i += 2) {
            ans.emplace_back(v[i]);
          }
        }
      }
      if((int) ans.size() < N) {
        cout << "No\n";
      } else {
        cout << "Yes\n";
        for(int i = 0; i < N; i++) {
          cout << ans[i] + 1 << " \n"[i == N - 1];
        }
      }
    }
  }
  return 0;
}