// LUOGU_RID: 148674566
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
const ll _=2e5+5;
ll N,n,m,k,s,t,x,y,a[_],b[_],i,j;
inline ll p(ll x){return x*(x-1)/2;}
void P(){
	cin>>n>>k>>m>>s;t=k%m;s-=t*n;
	if(s%m){cout<<"NO\n";return;}
	s/=m;k/=m;
	for(i=1;i<=n;i++){
		x=(k*2+i-1)*i/2;
		if(x>s)break;
		if(i+a[s-x]>n)continue;
		cout<<"YES\n";
		for(j=0;j<i;j++)cout<<(k+j)*m+t<<' ';
		for(y=s-x;y;y-=p(b[y]))for(j=0;j<b[y];j++)cout<<j*m+t<<' ';
		for(j=i+a[s-x];j<n;j++)cout<<t<<' ';
		cout<<'\n';return;
	}
	cout<<"NO\n";
}
int main(){
	ios::sync_with_stdio(0);cin.tie(0);cout.tie(0);
	for(i=1;i<_;i++){
		a[i]=1e18;
		for(j=2;x=p(j),x<=i;j++)if(a[i-x]+j<a[i])a[i]=a[i-x]+j,b[i]=j;
	}
	cin>>N;while(N--)P();
}