func_code_string:    #include<bits/stdc++.h>         using namespace std;   #define FAST ios::sync_with_stdio(0); cin.tie(0); cout.tie(0);      #define PB(x, v) x.push_back(v);   #define M_P(a, b) make_pair(a, b)   #define pll pair<ll, ll>   #define ll long long int   #define mll map<ll, ll>   #define vl vector<ll>   #define fa(x, v) for(auto x: v)   #define fr(i, a, b, step) for(auto i= a;i <=b; i+=step)   #define TEST  Int test; cin >> test; while(test--)   #define FTEST Int TesT; cin >> TesT; for(Int test = 1; test<=TesT; test++)   /**So..a**/   #define B_ begin()   #define E_ end()   #define all(a) a.begin(), a.end()   #define rall(a) a.rbegin(), a.rend()   #define NL_   n    #define F first   #define S second   #define FF first.first   #define FS first.second   #define SF second.first   #define SS second.second   #include <iomanip>   #define __lcm(a, b) (a/__gcd(a, b)*b)   #define PI acos(-1)   #define EXP 10e-6    ll prime(ll a,ll b){     ll ans=0;                         return ans;    }   int main()   {                              ll n,m,k,i,j,sum=0,cnt=0,x;              string s,ss,str,st;            bool sign=1,ok=true,cheak=1;            ll t,tc;           ll a,b,c;           ll ans=0;              ok=1;             sum=0;                          ll fac=1;           cin>>t;           while(t--)           {            cnt=0;            ok=1;sign=0;              int first=0;              int p=0;              int fst=0,scnd=0;            cin>>n>>k;                         int mid=(n+1)/2;                            vector<ll>vv,v;             for(i=1;i<=mid;i++){                            vv.push_back(i);                      }             for(i=mid+1;i<=n;i++){                            v.push_back(i);       }       /*       for(auto i:vv)cout<<i<<   ;       cout<<endl;       for(auto i:v)cout<<i<<   ;       cout<<endl;            */            if(k==0){             for(i=1;i<=n;i++)cout<<i<<   ;             cout<<endl;             continue;      }                    if((k+k+1) > n)cout<<-1<<endl;      else {               for(i=1;i<=n;i++)       {                    if(ok){                    cout<<vv[first++]<<   ;         ok=0;         sign=1;              fst++;         continue;        }            if(sign){                       ok=1;         sign=0;         cout<<v[p++]<<   ;          scnd++;         cnt++;          if(cnt==k)break;        }       }              for(i=fst;i<vv.size();i++)cout<<vv[i]<<   ;       for(i=scnd;i<v.size();i++)cout<<v[i]<<   ;                     cout<<endl;      }                 }                         return 0;   }    