#include <bits/stdc++.h>
using namespace std;

int ans[200005]; 
vector<int> ans0[200005], ans1[200005]; 

void solve(int B) {
    int p[20], w[20]; bool vis[20]; 
    for (int n = 2;; ++n) {
        // 2(a[n] a[n-1] a[1]) = (a[p[n]], a[p[n-1]], a[p[1]])
        for (int i = 1; i <= n; ++i) p[i] = i; 
        do {
            for (int s = 2; s < 1 << n; s += 2) {
                for (int i = 1; i <= n; ++i) w[i] = -1, vis[i] = 0; 
                for (int i = 1; i <= n; ++i) if (!vis[i]) {
                    int a[20] = {0}, wx[20] = {0}, wy[20] = {0}, m = 0; 
                    for (int j = i; !vis[j]; j = p[j]) vis[a[++m] = j] = 1;
                    wx[1] = 1; wy[1] = 0; 
                    for (int j = 2; j <= m; ++j) {
                        wx[j] = wx[j - 1] * 2; 
                        wy[j] = wy[j - 1] * 2 + (s >> a[j - 1] - 1 & 1) - B * (s >> a[j - 1] & 1); 
                    }
                    wx[1] = wx[m] * 2 - 1; 
                    wy[1] = wy[m] * 2 + (s >> a[m] - 1 & 1) - B * (s >> a[m] & 1); 
                    if (wy[1] % wx[1] != 0) continue; 
                    w[a[1]] = -wy[1] / wx[1]; 
                    for (int j = 2; j <= m; ++j) w[a[j]] = wx[j] * w[a[1]] + wy[j];
                }
                bool flag = 1; 
                for (int i = 1; i <= n; ++i) flag &= (0 <= w[i] && w[i] < B); 
                if (flag) {
                    ans[B] = n; 
                    for (int i = 1; i <= n; ++i) if (s >> i & 1) {
                        for (int j = n; j > i; --j) ans0[B].emplace_back(w[j]);
                        for (int j = i; j >= 1; --j) ans1[B].emplace_back(w[j]); 
                        return;  
                    }
                }
            }
        } while (next_permutation(p + 1, p + n + 1)); 
    }
}

int main(void) {
    int T, n, B; scanf("%d", &T); 
    while (T--) {
        scanf("%d%d", &n, &B); 
        if (!ans[B]) solve(B);
        if (ans[B] > n) { puts("-1"); continue; }
        vector<int> A; 
        for (int x : ans0[B]) A.emplace_back(x); 
        for (int i = 0; i < n - ans[B]; ++i) A.emplace_back(B - 1); 
        for (int x : ans1[B]) A.emplace_back(x); 
        for (int x : A) printf("%d ", x); 
        putchar('\n'); 
    }
    return 0;
}