
#include <iostream>  
#include <bits/stdc++.h> 
#include <stdio.h>
#include <cstdlib>
#include<algorithm> 
#include<string.h>
#include<map>
#include<math.h>
using namespace std; 
int main()
{
int t;
cin>>t;
while(t--)
{
int n,k;
cin>>n>>k;int count =0;
vector <int> v,a(n);int max=n;
if(k>(n-1)/2)
 {   cout<<"-1"<<endl;
    continue;
}
for(int i=1;i<n;i+=2)
{
    if(count==k)
        break;
    a[i]=max;
    max--;
        count++;

}
for(int i=0;i<n;i++)
{
    if(a[i]!=0)
        continue;
    a[i]=max;
    max--;
}
for(int i=0;i<n;i++)
{
    cout<<a[i]<<" ";
}

cout<<endl;
}
}