#include<bits/stdc++.h>
#define pf printf
#define sc(x) scanf("%d", &x)
#define scs(x) scanf("%s", x)
#define scl(x) scanf("%lld", &x)
#define mst(a,x) memset(a, x, sizeof(a))
#define rep(i,s,e) for(int i=s; i<e; ++i)
#define dep(i,e,s) for(int i=e; i>=s; --i)
#define INF 0x3f3f3f3f
using namespace std;
typedef  long long ll;
typedef pair<ll,ll> pii;
const long long MOD = 1000000007;
int ans[505];
int a[505];
int main()
{
	ans[0] = 0;
	rep(i,1,501)ans[i] = ans[i - 1] + i;
	int t;sc(t); 
	while(t--){
		int n,l,r,s;scanf("%d %d %d %d",&n,&l,&r,&s);
		int tag = r - l + 1;
		if((n * (n + 1) / 2) - ((n - tag) * (n - tag + 1) / 2) < s || (tag * (tag + 1) / 2) > s){
			pf("-1\n");
			continue;
		}
		int tmp = 0;
		rep(i,0,n - tag + 1){
			if(ans[i + tag] - ans[i] >= s){
				tmp = i + tag;
				break;
			}
		}
		set<int> s0;
		set<int> s1;
		int c0 = ans[tmp] - ans[tmp - tag] - s;
		rep(i,1,n+1)s0.insert(i);
		dep(i,tmp,tmp - tag + 1){
			if(i < tmp - tag + 1 + c0) s0.erase(i - 1),s1.insert(i - 1);
			else s0.erase(i),s1.insert(i);
		}
		rep(i,1,n+1){
			if(i < l || i > r){
				int x = *s0.begin();
				a[i] = x;
				s0.erase(a[i]);
			}else{
				int x = *s1.begin();
				a[i] = x;
				s1.erase(a[i]);
			}
		}
		rep(i,1,n)pf("%d ",a[i]);
		pf("%d\n",a[n]);
	}
}