#include <bits/stdc++.h>
using namespace std;
using vi = std::vector<int> ;
void solve() {
	int K, M, N;
	cin >> K >> M >> N;
	M --;
	vi did(K, 0);
	vi ans;
	for (int d = 0; d < K; d ++) {
		if (did[d]) continue;
		int a = d, b = (d + M) % K;
		while ((!did[a]) && (!did[b])) {
			did[a] = did[b] = 1;
			ans.push_back(a);
			a = (a + M * 2) % K;
			b = (b + M * 2) % K;
		}
		did[a] = did[b] = 1;
	}
	if (ans.size() < N) {
		puts("No");
	} else {
		puts("Yes");
		for (int i = 0; i < N; i ++) {
			cout << ans[i] << (i < N - 1 ? " " : "");
		}
		cout << endl;
	}
}
int main () {
	int T;
	cin >> T;
	while (T--) solve();
}