#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<int> s, c;
      int canmax = 0;
      for(int i = 0; i < N; i++) {
        int cnt = 0;
        int now = i;
        if(!seen[i]) {
          while(!seen[now]) {
            cnt++;
            seen[now] = true;
            now = G[now];
          }
          s.emplace_back(i);
          c.emplace_back(cnt);
          canmax += cnt / 2;
        }
      }
      if(canmax < N) {
        cout << "No\n";
      } else {
        cout << "Yes\n";
        seen.assign(K, false);
        for(int i = 0; i < K; i++) {
          if(!seen[i]) {
            int now = i;
            bool mode = true;
            while(!seen[now]) {
              if(N == 0) {
                break;
              }
              if(mode) {
                N--;
                cout << now + 1 << " \n"[N == 0];
              }
              seen[now] = true;
              now = G[now];
              mode ^= true;
            }
          }
        }
      }
    }
  }
  return 0;
}