#include <bits/stdc++.h>
using namespace std;

void solve() {
  int K, M, N;
  cin >> K >> M >> N;
  vector<int> c(K, -1), p(K);
  for(int i = 0; i < K; i++) {
    p[i] = (i + M - 1) % K;
  }
  for(int i = 0; i < K; i++) {
    if(c[i] != -1) continue;
    int v = i;
    c[v] = 0;
    while(c[p[v]] == -1) {
      c[p[v]] = 1 - c[v];
      v = p[v];
    }
  }
  int cnt = accumulate(c.begin(), c.end(), 0);
  if(cnt < N) {
    cout << "No" << "\n";
  }else {
    cout << "Yes" << "\n";
    for(int i = 0; i < K && N > 0; i++) {
      if(c[i] == 1) {
        N--;
        cout << i + 1 << " \n"[N == 0];
      }
    }
  }
}

int main() {
  int T;
  cin >> T;
  while(T--) solve();
}