#include <iostream>
#include <vector>
#include <algorithm>

using namespace std;

void solve()
{
  int k, m, n;
  cin >> k >> m >> n;
  if (n * 2 > k || m == 1)
  {
    cout << "No" << endl;
    return;
  }
  auto cal = [&](int d) -> int {return (d + m - 2) % k + 1;};
  vector<int> ans, used(k + 1);
  int now = 1;
  while (ans.size() < n)
  {
    while (now <= k && used[now]) ++now;
    if (now > k) break;
    int d = cal(now);
    if (!used[d])
    {
      used[now] = 1;
      used[d] = 1;
      ans.push_back(now);
    }
    else ++now;
  }
  if (ans.size() == n)
  {
    cout << "Yes" << endl;
    for (auto v : ans) cout << v << ' ';
    cout << endl;
    return;
  }
  ans.clear();
  used.assign(k + 1, 0);
  for (now = 1; now <= k; now += m)
  {
    int d = cal(now);
    if (d < now || ans.size() >= n) break;
    if (!used[now] && !used[d])
    {
      used[now] = 1;
      used[d] = 1;
      ans.push_back(now);
    }
  }
  now = 1;
  while (ans.size() < n)
  {
    while (now <= k && used[now]) ++now;
    if (now > k) break;
    int d = cal(now);
    if (!used[d])
    {
      used[now] = 1;
      used[d] = 1;
      ans.push_back(now);
    }
    else ++now;
  }
  if (ans.size() == n)
  {
    cout << "Yes" << endl;
    for (auto v : ans) cout << v << ' ';
    cout << endl;
  }
  else cout << "No" << endl;
}

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