#include<bits/stdc++.h>
using namespace std;
using ll = long long;
using ld = long double;
using pii = pair<int, int>;
using pll = pair<ll, ll>;
using vi = vector<int>;
using vvi = vector<vi>;
using vll = vector<ll>;
using vvll = vector<vll>;

#define f(i, a, b) for(int i = (a); i < (b); ++i)
#define PB push_back
#define fi first
#define se second
#define all(x) (x).begin(),(x).end()
#define sz(x) int((x).size())

void setIO(string name = "") { 
	ios_base::sync_with_stdio(0); cin.tie(0); 
	if(sz(name)){
		freopen((name+".in").c_str(), "r", stdin); 
		freopen((name+".out").c_str(), "w", stdout);
	}
}

void solve()
{
	int n, l, r, s; cin >> n >> l >> r >>s;
	int w = r-l;
	//vector<vector<bool>> dp(s+1,vector<bool>(n+1, false));
	vll pref(n+1, 0);
	vll suf(n+1,0);
	set<ll> in_pref;
	in_pref.insert(0);
	f(i,1,n+1)
	{
		pref[i] = pref[i-1]+i;
		in_pref.insert(pref[i]);
	}
	for(int i = n; i >= 1; i--)
		suf[n-i+1] = suf[n-i] + i;
	if(pref[w+1] <= s && suf[w+1] >= s)
	{
		vi v;
		f(i,1,w+2)
			v.PB(i);
		ll su = pref[w+1];
		int i = sz(v)-1;
		while(su < s && i >= 0)
		{
			if(i < sz(v)-1 && v[i]+1==v[i+1])
				i--;
			else
			{
				v[i]++;
				su++;	
				if(v[i]==n)
					i--;
			}
		}
		set<int> setak;
		for(auto x: v)
			setak.insert(x);
		vi out;
		i = 0;
		int num = 1;
		l--;r--;
		while(i < l)
		{
			if(setak.find(num) == setak.end())
			{
				out.PB(num);
				i++;
			}
			num++;
		}
		while(i <= r)
		{
			out.PB(v[i-l]);
			i++;
		}
		while(i < n)
		{
			if(setak.find(num) == setak.end())
			{
				out.PB(num);
				i++;
			}
			num++;
		}
		for(auto &el :out)
			cout << el << ' ';
		cout << '\n';
	}
	else
	{
		cout << "-1\n";
	}




}

signed main()
{	
	setIO();

	int t;
	t = 1;
	cin >> t;
	while(t--)
		solve();
  return 0;
}

