#include<bits/stdc++.h> 
using namespace std; 

#define rep(i,a,b) for(ll i=a;i<b;i++)
#define pb push_back
#define lcm(a,b)     (a*b)/__gcd(a,b)
#define bs(v,x)      binary_search(v.begin(),v.end(),x)
#define ub(v,x)      upper_bound(v.begin(),v.end(),x)
#define lb(v,x)      lower_bound(v.begin(),v.end(),x)
#define IOS ios::sync_with_stdio(0); cin.tie(0); cout.tie(0)
#define all(a) (a).begin(),(a).end() 
#define trace(v) for(auto it=v.begin();it!=v.end();it++)cout<<*it<<" ";cerr<<endl;
#define Pi 3.14159265
#define reset(x) memset(x,0,sizeof(x))
#define f first
#define s second
#define mp make_pair
#define PII pair<ll, ll> 
#define pq1 priority_queue<ll>
#define pq2 priority_queue<ll, vector<ll>,greater<ll>>
typedef long long ll;
typedef vector<ll> vll;
typedef vector<pair<ll,ll>> vpll;
typedef bool B;
typedef double ff;
const ll INF=1e10;
const ll N = 998244353;
char en='\n';

         void solve()   
         {
               ll n,k; cin>>n>>k;
               vll v;
               ll j=n-k,g=k-1,u=k-2;
               rep(i,1,k+1)
                  v.pb(i);
                  while(j--)
                  {
                     swap(v[g],v[u]);
                     g--;
                     u--;
                  }
               reverse(v.begin()+g+1,v.end());
               trace(v);
         } 

         int main() 
         { 
                  ios_base::sync_with_stdio(false);cin.tie(NULL); 
                  
                  #ifndef ONLINE_JUDGE 
                  freopen("input.txt", "r", stdin); 
                  freopen("error.txt", "w", stderr); 
                  freopen("out.txt", "w", stdout); 
                  #endif   
                  int t=1; 
                  cin>>t; 
                  while(t--) 
                  { 
                     solve(); 
                     cout<<"\n"; 
                  }
                  cerr<<"time taken : "<<(float)clock()/CLOCKS_PER_SEC<<" secs"<<endl; 
                  return 0; 
         }                 
                  

### Prompt

Your challenge is to write a CPP solution to the following problem:

You have a sequence a with n elements 1, 2, 3, ..., k - 1, k, k - 1, k - 2, ..., k - (n - k) (k ≤ n < 2k).

Let's call as inversion in a a pair of indices i < j such that a[i] > a[j].

Suppose, you have some permutation p of size k and you build a sequence b of size n in the following manner: b[i] = p[a[i]].

Your goal is to find such permutation p that the total number of inversions in b doesn't exceed the total number of inversions in a, and b is lexicographically maximum.

Small reminder: the sequence of k integers is called a permutation if it contains all integers from 1 to k exactly once.

Another small reminder: a sequence s is lexicographically smaller than another sequence t, if either s is a prefix of t, or for the first i such that s_i ≠ t_i, s_i < t_i holds (in the first position that these sequences are different, s has smaller number than t).

Input

The first line contains a single integer t (1 ≤ t ≤ 1000) — the number of test cases.

The first and only line of each test case contains two integers n and k (k ≤ n < 2k; 1 ≤ k ≤ 10^5) — the length of the sequence a and its maximum.

It's guaranteed that the total sum of k over test cases doesn't exceed 10^5.

Output

For each test case, print k integers — the permutation p which maximizes b lexicographically without increasing the total number of inversions.

It can be proven that p exists and is unique.

Example

Input


4
1 1
2 2
3 2
4 3


Output


1 
1 2 
2 1 
1 3 2 

Note

In the first test case, the sequence a = [1], there is only one permutation p = [1].

In the second test case, the sequence a = [1, 2]. There is no inversion in a, so there is only one permutation p = [1, 2] which doesn't increase the number of inversions.

In the third test case, a = [1, 2, 1] and has 1 inversion. If we use p = [2, 1], then b = [p[a[1]], p[a[2]], p[a[3]]] = [2, 1, 2] and also has 1 inversion.

In the fourth test case, a = [1, 2, 3, 2], and since p = [1, 3, 2] then b = [1, 3, 2, 3]. Both a and b have 1 inversion and b is the lexicographically maximum.

### Response

```cpp
#include<bits/stdc++.h> 
using namespace std; 

#define rep(i,a,b) for(ll i=a;i<b;i++)
#define pb push_back
#define lcm(a,b)     (a*b)/__gcd(a,b)
#define bs(v,x)      binary_search(v.begin(),v.end(),x)
#define ub(v,x)      upper_bound(v.begin(),v.end(),x)
#define lb(v,x)      lower_bound(v.begin(),v.end(),x)
#define IOS ios::sync_with_stdio(0); cin.tie(0); cout.tie(0)
#define all(a) (a).begin(),(a).end() 
#define trace(v) for(auto it=v.begin();it!=v.end();it++)cout<<*it<<" ";cerr<<endl;
#define Pi 3.14159265
#define reset(x) memset(x,0,sizeof(x))
#define f first
#define s second
#define mp make_pair
#define PII pair<ll, ll> 
#define pq1 priority_queue<ll>
#define pq2 priority_queue<ll, vector<ll>,greater<ll>>
typedef long long ll;
typedef vector<ll> vll;
typedef vector<pair<ll,ll>> vpll;
typedef bool B;
typedef double ff;
const ll INF=1e10;
const ll N = 998244353;
char en='\n';

         void solve()   
         {
               ll n,k; cin>>n>>k;
               vll v;
               ll j=n-k,g=k-1,u=k-2;
               rep(i,1,k+1)
                  v.pb(i);
                  while(j--)
                  {
                     swap(v[g],v[u]);
                     g--;
                     u--;
                  }
               reverse(v.begin()+g+1,v.end());
               trace(v);
         } 

         int main() 
         { 
                  ios_base::sync_with_stdio(false);cin.tie(NULL); 
                  
                  #ifndef ONLINE_JUDGE 
                  freopen("input.txt", "r", stdin); 
                  freopen("error.txt", "w", stderr); 
                  freopen("out.txt", "w", stdout); 
                  #endif   
                  int t=1; 
                  cin>>t; 
                  while(t--) 
                  { 
                     solve(); 
                     cout<<"\n"; 
                  }
                  cerr<<"time taken : "<<(float)clock()/CLOCKS_PER_SEC<<" secs"<<endl; 
                  return 0; 
         }                 
                  

```