#include<bits/stdc++.h>

using namespace std;

#define pi 3.1415926536
#define pb push_back
#define F first
#define S second
#define endl "\n"
#define bs binary_search
#define int long long
#define float double
#define mii map<int,int>
#define mci map<char,int>
#define msi map<string,int>
#define mss map<string,string>
#define mcc map<char,char>
#define mpi map<pair<int,int>,int>
#define vi vector<int>
#define vs vector<string>
#define si set<int>
#define ss set<string>
#define sc set<char>
int const max1= 1e5+5;
int const mod = 1e9+7;
int inf = 1e18;
int ans = inf;

int32_t main(){
ios::sync_with_stdio(0);
cin.tie(0);
int tc=1;
cin>>tc;
while(tc--){
    int n,l,r,s;
    cin>>n>>l>>r>>s;
    int k = r-l+1;
    int a[k];
    int total=0;
    for(int i=0;i<k;i++){
        a[k-i-1]=n-i;
        total+=n-i;
    }
    if(total<s){
        cout<<-1<<endl;
        continue;
    }
    int i=0;
    while(total>s && i<k){
        int temp =min(a[i]-i-1,total-s);
        a[i]-=temp;
        total-=temp;
        i++;
    }
    if(total>s){
        cout<<-1<<endl;
        continue;
    }
    si taken;
    for(i=0;i<k;i++){
        taken.insert(a[i]);
    }
    l--;
    r--;
    for(i=0;i<l;i++){
        for(int j=1;j<=n;j++){
            if(taken.count(j)==0){
                cout<<j<<" ";
                taken.insert(j);
                break;
            }
        }
    }
    for(i=0;i<k;i++){
        cout<<a[i]<<" ";
    }
    for(i=r;i<n;i++){
        for(int j=1;j<=n;j++){
            if(taken.count(j)==0){
                cout<<j<<" ";
                taken.insert(j);
            }
        }
    }
    cout<<endl;
}
}
