#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
const ll MAXN=1e5+5;
ll T;
ll n,d,k,fl;
ll deep[MAXN];
int main(){
	cin>>T;
	while(T--){
		cin>>n>>d>>k;
		if(n==1){
			cout<<"YES"<<endl;
			return 0;
		}
		fl=0;
		for(int i=1,nowd=0;i<=n;i++){
			if(1+i*k>n)break;
			nowd+=i*k;
			deep[i]=k;
			if(n-i*k-1<=d-nowd&&d-nowd<=(n-i*k-1)*i){
				cout<<"YES"<<endl;
				fl=1;
				if(n-i*k-1){
					deep[(d-nowd)/(n-i*k-1)]+=(n-i*k-1)-(d-nowd)%(n-i*k-1);
					deep[(d-nowd)/(n-i*k-1)+1]+=(d-nowd)%(n-i*k-1);
				}
				for(int j=1,p=1;j<=i;j++){
					for(int k=1;k<=deep[j];k++)cout<<p<<" ";
					p+=deep[j];
				}
				cout<<endl;
				break;
			}
		}
		if(!fl)cout<<"NO"<<endl;
	}
	return 0;
}