#include <bits/stdc++.h>
#define Getchar() p1 == p2 and (p2 = (p1 = Inf) + fread(Inf, 1, 1 << 21, stdin), p1 == p2) ? EOF : *p1++
#define Putchar(c) p3 == p4 and (fwrite(Ouf, 1, 1 << 21, stdout), p3 = Ouf), *p3++ = c
char Inf[1 << 21], Ouf[1 << 21], *p1, *p2, *p3 = Ouf, *p4 = Ouf + (1 << 21);
inline int read (void)
{
    int x = 0; char c = Getchar();
    while (c < '0' or c > '9') c = Getchar();
    while (c >= '0' and c <= '9') x = x * 10 + c - 48, c = Getchar();
    return x;
}
inline void write (int x)
{
    if (x >= 10) write(x / 10), x %= 10;
    Putchar(x ^ 48);
}
const int maxn = 200000 + 10;
int ans[maxn]; std::vector<int> ans0[maxn], ans1[maxn];
inline void solve (int B)
{
    int p[20], w[20]; bool vis[20];
    for (int n = 3; ; n++)
    {
        for (int i = 1; i <= n; i++) p[i] = i;
        while (std::next_permutation(p + 1, p + n + 1))
            for (int S = 2; S < (1 << n - 1); S += 2)
            {
                for (int i = 1; i <= n; i++) w[i] = -1, vis[i] = false;
                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] = true;
                    wx[1] = 1; wy[1] = 0;
                    for (int j = 2; j <= m; j++)
                    {
                        wx[j] = 2 * wx[j - 1];
                        wy[j] = 2 * wy[j - 1] + ((S >> (a[j - 1] - 1)) & 1) - B * ((S >> a[j - 1]) & 1);
                    }
                    wx[1] = 2 * wx[m] - 1;
                    wy[1] = 2 * wy[m] + ((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 = true;
                for (int i = 1; i <= n; i++) flag &= 0 <= w[i] and 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].push_back(w[j]);
                        for (int j = i; j > 0; j--) ans1[B].push_back(w[j]);
                        return;
                    }
                }
            }
    }
}
signed main () {
    for (int T = read(); T--; ) {
        int n = read(), B = read();
        if (!ans[B]) solve(B);
        if (ans[B] > n) {Putchar('-'); Putchar('1'); Putchar('\n'); continue;}
        std::vector<int> Ans;
        for (int x: ans0[B]) Ans.push_back(x);
        for (int i = 0; i < n - ans[B]; i++) Ans.push_back(B - 1);
        for (int x: ans1[B]) Ans.push_back(x);
        for (int i = 0; i < n; i++) write(Ans[i]), Putchar(" \n"[i == n - 1]);
    }
    fwrite(Ouf, 1, p3 - Ouf, stdout); fflush(stdout);
    return 0;
}