t = int(input())
for tidx in range(t):
n, l, r, s = [int(x) for x in input().split()]
if s > n*(n+1)//2 - (n-r+l)*(n-r+l-1)//2 or s < (r-l+1)*(r-l+2)//2:
print(-1)
else:
x = list(range(1, r-l+2))
m = s - sum(x)
for i in range(r-l+1):
j = r-l-i
xjold = x[j]
x[j] = min(n-i, x[j] + m)
m = m - x[j] + xjold
y = list(set(range(1, n+1)).difference(x))
print(*y[:(l-1)], *x, *y[(l-1):])
#include <bits/stdc++.h>
using namespace std;
int main() {
ios_base::sync_with_stdio(false);
cin.tie(nullptr);
cout.tie(nullptr);
int tc; cin >> tc;
while(tc--) {
int n, l, r, s;
cin >> n >> l >> r >> s;
if(s < (r - l + 1) * (r - l + 2) / 2 || s > (r - l + 1) * (2 * n - r + l) / 2) {
cout << "-1\n";
continue;
}
vector <int> ans(n + 1);
int d = (s - (r - l + 1) * (r - l + 2) / 2) / (r - l + 1);
int extra = (s - (r - l + 1) * (r - l + 2) / 2) % (r - l + 1);
set <int> not_used;
for(int i = 1; i <= n; i++) not_used.insert(i);
for(int i = l; i <= r; i++) {
ans[i] = i - l + d + 1;
if(r - extra < i) ans[i]++;
not_used.erase(ans[i]);
}
for(int i = 1; i < l; i++) {
ans[i] = *not_used.begin();
not_used.erase(*not_used.begin());
}
for(int i = r + 1; i <= n; i++) {
ans[i] = *not_used.begin();
not_used.erase(*not_used.begin());
}
for(int i = 1; i <= n; i++) cout << ans[i] << " ";
cout << "\n";
}
return 0;
}
1047. Remove All Adjacent Duplicates In String | 977. Squares of a Sorted Array |
852. Peak Index in a Mountain Array | 461. Hamming Distance |
1748. Sum of Unique Elements | 897. Increasing Order Search Tree |
905. Sort Array By Parity | 1351. Count Negative Numbers in a Sorted Matrix |
617. Merge Two Binary Trees | 1450. Number of Students Doing Homework at a Given Time |
700. Search in a Binary Search Tree | 590. N-ary Tree Postorder Traversal |
589. N-ary Tree Preorder Traversal | 1299. Replace Elements with Greatest Element on Right Side |
1768. Merge Strings Alternately | 561. Array Partition I |
1374. Generate a String With Characters That Have Odd Counts | 1822. Sign of the Product of an Array |
1464. Maximum Product of Two Elements in an Array | 1323. Maximum 69 Number |
832. Flipping an Image | 1295. Find Numbers with Even Number of Digits |
1704. Determine if String Halves Are Alike | 1732. Find the Highest Altitude |
709. To Lower Case | 1688. Count of Matches in Tournament |
1684. Count the Number of Consistent Strings | 1588. Sum of All Odd Length Subarrays |
1662. Check If Two String Arrays are Equivalent | 1832. Check if the Sentence Is Pangram |