func_code_string: #include<bits/stdc++.h>   using namespace std;      typedef long long ll;   typedef pair<int,int> pii;   typedef vector<int> vi;   typedef vector<vi> vvi;   typedef vector<ll> vl;   typedef vector<vl> vvl;   typedef vector<string> vs;   typedef vector<vs> vvs;   typedef vector<pii> vpii;   typedef set<int> si;   typedef unordered_set<int> usi;   typedef multiset<int> msi;   typedef map<int,int> mi;   typedef unordered_map<int,int> umi;   typedef multimap<int,int> mmi;      #define f1(a,b,c) for(int(a)=(b);(a)<(c);(a)++)   #define f2(a,b,c) for(int(a)=(b);(a)<=(c);(a)++)   #define f3(a,b,c) for(int(a)=(b);(a)>(c);(a)--)   #define f4(a,b,c) for(int(a)=(b);(a)>=(c);(a)--)   #define fi(a,b) for(auto(a)=b.begin();(a)!=b.end();(a)++)   #define pb push_back   #define all(v) v.begin(),v.end()   #define nper next_permutation   #define pper prev_permutation   #define mp make_pair   #define F first   #define S second      int main()   {    ios_base::sync_with_stdio(false);    cin.tie(NULL);    int t;    cin>>t;    f1(i,0,t)    {     int n,k,x=1;     cin>>n>>k;     f1(j,0,(2*k)-n-1)     {      cout<<x<<   ;x++;     }     x=k;     f1(j,0,n-k+1)     {      cout<<x<<   ;x--;     }     cout<<  n ;    }    /*f1(i,0,t)    {     cout<<v[i]<<  n ;    }*/    return 0;   }                                                         