#include<bits/stdc++.h>
		using namespace std;int z=0;
		vector<int>lena_sort(std::vector<int> nums,int n,int cum,int c) {
		    if (n<= 1) {
		        return nums;
		    }
		    int pivot = nums[0];
		    vector<int> less;
		    vector<int> more;
		    int l=0,m=0;
		    for (int i = 1; i < n; ++i) {
		    	if(cum==c)
		    		return nums;
		    	c++;
		        if (nums[i] < pivot) {
		            less.push_back(nums[i]);
		            l++;z++;
		        }
		        else {
		            more.push_back(nums[i]);
		            m++;z++;
		        }
		    }
		    vector <int > sorted_less = lena_sort(less,l,cum,c);
		    vector <int > sorted_more = lena_sort(more,m,cum,c);
		    vector <int > ans;
		    ans.insert(ans.end(),sorted_less.begin(),sorted_less.end());
		    ans.push_back(pivot);
		    ans.insert(ans.end(),sorted_more.begin(),sorted_more.end());

		    
		    return ans;
		}
		int main()
		{
		int q;
		cin>>q;
		while(q--)
		{
				std::vector<int > v;
				int n;int cc;
				cin>>n>>cc;
				 for(int i=n;i>=1;i--)
					{v.push_back(i);}
				vector<int> x=lena_sort(v,n,cc,0);
				for(int i=0;i<x.size();i++)
					cout<<x[i]<<" ";
				cout<<endl;
		}



		return 0;
		}