//Code by Ritik Agarwal
#include<bits/stdc++.h>
using namespace std;
#define sz(x) (int)(x).size() 
#define int long long int
#define loop(i,a,b) for(int i=a;i<b;i++)
#define scan(arr,n) for (int i = 0; i < n; ++i) cin >> arr[i]
#define vi vector<int>
#define si set<int>
#define pii pair <int, int>
#define sii set<pii>
#define vii vector<pii>
#define mii map <int, int>
#define pb push_back
#define ff first
#define ss second
#define all(aa) aa.begin(), aa.end()
#define rall(a) a.rbegin() , a.rend()
#define read(a,b) int a,b;  cin>>a>>b
#define readt(a,b,c) int a,b,c; cin>>a>>b>>c
#define readf(a,b,c,d) int a,b,c,d; cin>>a>>b>>c>>d;
#define print(v) for(auto x:v) cout<<x<<" ";cout<<endl
#define printPair(res) for(pair<int,int>& p:res) cout<<p.first<<" "<<p.second<<endl;
#define faster ios_base::sync_with_stdio(false); cin.tie(NULL); cout.tie(NULL)
//*****  Constants  *****
const int mod = 1000000007; /* 1e9 + 7*/
const int MAXN = 1500005; /*1e6 +5 */
const int mod1= 998244353;
const int NAX=2E5+5;
int vis[MAXN]={0};
int fac[300001];
void fact(int m){fac[0]=1;for(int i=1;i<=300000;i++) fac[i]=(fac[i-1]%m * i%m)%m;}
/* Iterative Function to calculate (x^y)%p in O(log y)*/
long long power( long long x,  int y, int p){   long long res = 1;  
x = x % p; while (y > 0) { if (y & 1)  res = (res * x) % p;  y = y >> 1; x = (x * x) % p;} return res;}
// Returns n^(-1) mod p 
long long modInverse( long long n, int p) {  return power(n, p - 2, p); }
long long nCr( long long n,int r, int p) { if (r == 0) return 1; if(n<r) return 0;
return (fac[n] * modInverse(fac[r], p) % p * modInverse(fac[n - r], p) % p) % p; } 

int binarySearch(vi arr, int l, int r, int x) { 
if (r >= l) { int mid = l + (r - l) / 2; if (arr[mid] == x) return mid; 
if (arr[mid] > x)  return binarySearch(arr, l, mid - 1, x); 
return binarySearch(arr, mid + 1, r, x); } return -1; } 
bool sortGrt(const pair<int,int> &a, 
              const pair<int,int> &b) 
{ 
  
    return (a.second > b.second); 
  
} 
void solve(int test)
{
  read(n,k);
  int req=n-k+1;
  vi v;
  for(int i=1;i<=k-req;i++)
    v.pb(i);
  for(int i=k;i>=k-req+1;i--)
    v.pb(i);

  print(v);
}

int32_t main()
{
      #ifndef ONLINE_JUDGE
          freopen("input.txt", "r", stdin);
          freopen("output.txt", "w", stdout);
      #endif
      faster;
      fact(mod);
      int t=1;
      cin>>t;
      for(int test=1;test<=t;test++)
      {
          solve(test);
      }
}