#include <bits/stdc++.h>
//#include <atcoder/all>
using namespace std;
//using namespace atcoder;
//using mint = modint1000000007;
//const int mod = 1000000007;
//using mint = modint998244353;
//const int mod = 998244353;
//const int INF = 1e9;
//const long long LINF = 1e18;
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define rep2(i,l,r)for(int i=(l);i<(r);++i)
#define rrep(i, n) for (int i = (n) - 1; i >= 0; --i)
#define rrep2(i,l,r)for(int i=(r) - 1;i>=(l);--i)
#define all(x) (x).begin(),(x).end()
#define allR(x) (x).rbegin(),(x).rend()
#define P pair<int,int>
template<typename A, typename B> inline bool chmax(A & a, const B & b) { if (a < b) { a = b; return true; } return false; }
template<typename A, typename B> inline bool chmin(A & a, const B & b) { if (a > b) { a = b; return true; } return false; }

int main() {
	ios::sync_with_stdio(false);
	cin.tie(nullptr);
	int t; cin >> t;
	while (t--) {
		long long k, m, n; cin >> k >> m >> n;
		if (1 == m) {
			cout << "No" << endl;
			continue;
		}
		m--;
		vector<bool>use(k);
		vector<int>ans;
		rep(i, k) {
			if (use[i])continue;
			int ci = i;
			vector<int>v = { i };
			use[i] = true;
			while (!use[(ci + m) % k]) {
				ci = (ci + m) % k;
				use[ci] = true;
				v.push_back(ci);
			}
			if (1 == v.size() % 2)v.pop_back();
			rep(j, v.size())if (0 == j % 2)ans.push_back(v[j]);
		}
		cout << ans.size() << endl;
		if (ans.size() > n)ans.resize(n);
		if (ans.size() == n) {
			cout << "Yes" << endl;
			for (auto e : ans)cout << e + 1 << " ";
			cout << endl;
		}
		else {
			cout << "No" << endl;
		}
	}
	return 0;
}