#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, s = 1;
  while (ans.size() < n)
  {
    while (s <= k && (used[s] || used[cal(s)])) ++s;
    if (s > k) break;
    now = s;
    while (ans.size() < n && !used[now] && !used[cal(now)])
    {
      ans.push_back(now);
      used[now] = 1;
      used[cal(now)] = 1;
      now += m;
      now = (now - 1) % k + 1;
    }
  }
  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();
}