#include <bits/stdc++.h>
#define all(x) (x).begin(), (x).end()
#define endl "\n"
#define pb(x) push_back(x)
#define fio() ios_base::sync_with_stdio(0); cin.tie(0)
#define fileio() ifstream file_in("boards.txt");ofstream file_out("boards.txt")
#define f first
#define s second
//#define double long double
#define db double
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
typedef tuple<int, int, int> tpi;
typedef tuple<ll, ll, ll> tpl;
typedef pair<double, ll> pdl;
typedef pair<double, int> pdi;
typedef pair<double, double> pdd;
const double pi = acos(-1);
const double eps = 1e-10;
const int dx[] = { 0,1,0,-1 };
const int dy[] = { 1,0,-1,0 };
const int MOD = 1e9+7;
const ll LMOD = 1e9+7; // PLZ check
const int INF = 0x3f3f3f3f;
const ll LINF = 0x3f3f3f3f3f3f3f3f;

void solve() {
	int n, k;
	cin >> n >> k;
	if (k > (n-1)/2) {
		cout << -1 << endl;
		return;
	}

	vector<int> a(n);
	for (int i = 0; i < n; i++) a[i] = i+1;
	
	int p = 1;
	while (p < n && k--) {
		swap(a[p], a[p+1]);
		p += 2;
	}

	for (int x : a) cout << x << ' ';
	cout << endl;
}
int main() {
	fio();
	int t;
	cin >> t;
	while (t--) solve();
	return 0;
} 