#include <bits/stdc++.h>
using namespace std;
typedef signed long long ll;

#define _P(...) (void)printf(__VA_ARGS__)
#define FOR(x,to) for(x=0;x<(to);x++)
#define FORR(x,arr) for(auto& x:arr)
#define FORR2(x,y,arr) for(auto& [x,y]:arr)
#define ALL(a) (a.begin()),(a.end())
#define ZERO(a) memset(a,0,sizeof(a))
#define MINUS(a) memset(a,0xff,sizeof(a))
template<class T> bool chmax(T &a, const T &b) { if(a<b){a=b;return 1;}return 0;}
template<class T> bool chmin(T &a, const T &b) { if(a>b){a=b;return 1;}return 0;}
//-------------------------------------------------------

int T,K,M,N;
vector<int> V[202020];
int vis[202020];
void solve() {
	int i,j,k,l,r,x,y; string s;
	
	cin>>T;
	while(T--) {
		cin>>K>>M>>N;
		M--;
		if(M==0) {
			cout<<"No"<<endl;
			continue;
		}
		
		vector<int> ret;
		FOR(i,K) if(vis[i]==0) {
			vector<int> cand={i};
			vis[i]=1;
			while(1) {
				x=(cand.back()+M)%K;
				if(x==i) break;
				vis[x]=1;
				cand.push_back(x);
			}
			if(cand.size()%2) cand.pop_back();
			FOR(j,cand.size()/2) ret.push_back(cand[j*2]+1);
		}
		
		if(ret.size()>=N) {
			cout<<"Yes"<<endl;
			FOR(i,N) cout<<ret[i]<<" ";
			cout<<endl;
		}
		else {
			cout<<"No"<<endl;
		}
		
		
	}
}


int main(int argc,char** argv){
	string s;int i;
	if(argc==1) ios::sync_with_stdio(false), cin.tie(0);
	FOR(i,argc-1) s+=argv[i+1],s+='\n'; FOR(i,s.size()) ungetc(s[s.size()-1-i],stdin);
	cout.tie(0); solve(); return 0;
}