#include<iostream>
#include<cstring>
#include<vector>
#include<numeric>
#include<algorithm>
using namespace std;
using LL = long long;
const int maxn = 2e5 + 5;
vector<int> f[maxn];

int main(){

#ifdef LOCAL
    freopen("data.in", "r", stdin);
    freopen("data.out", "w", stdout);
#endif

    cin.tie(0);
    cout.tie(0);
    ios::sync_with_stdio(0);

    int T;
    cin >> T;
    while(T--){
        int n, B;
        cin >> n >> B;
        for(int len = 2; ; len++){
            if (!f[B].empty()) break;
            vector<int> p(len);
            iota(p.begin(), p.end(), 0);
            do{
                for(int s = 1; s < 1 << (len - 1); s++){
                    vector<int> a(len);
                    vector<bool> v(len);
                    vector<int> c(len);
                    for(int i = 0; i < len - 1; i++){
                        c[i] = (s >> i & 1);
                    }
                    bool ok = true;
                    for(int i = 0; i < len; i++){
                        if (v[i]) continue;
                        vector<int> cycle;
                        for(int j = i; !v[j]; j = p[j]){
                            cycle.push_back(j);
                            v[j] = true;
                        }
                        const int m = cycle.size();
                        int k = 1, b = 0;
                        // a(p(j)) = a(j) * 2 - B * c(j) + c(j - 1)
                        for(int i = 1; i < m; i++){
                            k *= 2;
                            b = b * 2 - B * c[cycle[i - 1]] + (cycle[i - 1] >= 1 ? c[cycle[i - 1] - 1] : 0);
                        }
                        k *= 2;
                        b = b * 2 - B * c[cycle.back()] + (cycle.back() >= 1 ? c[cycle.back() - 1] : 0);
                        if (b % (k - 1)){
                            ok = false;
                            break;
                        }
                        a[cycle[0]] = -b / (k - 1);
                        k = 1, b = 0;
                        for(int i = 1; i < m; i++){
                            k *= 2;
                            b = b * 2 - B * c[cycle[i - 1]] + (cycle[i - 1] >= 1 ? c[cycle[i - 1] - 1] : 0);
                            a[cycle[i]] = k * a[cycle[0]] + b;
                        }
                    }
                    for(int i = 0; i < len; i++){
                        if (a[i] < 0 or a[i] >= B){
                            ok = false;
                            break;
                        }
                    }
                    if (ok){
                        reverse(a.begin(), a.end());
                        f[B] = a;
                        break;
                    }
                }
            }while(next_permutation(p.begin(), p.end()));
        }
        auto ans = f[B];
        if (ans.size() > n){
            cout << -1 << '\n';
            continue;
        }
        for(int i = ans.size() - 1; i >= 0; i--){
            if (ans[i] * 2 >= B){
                vector<int> bk;
                int cnt = ans.size() - i;
                int need = n - ans.size();
                while(cnt--){
                    bk.push_back(ans.back());
                    ans.pop_back();
                }
                while(need--){
                    ans.push_back(B - 1);
                }
                while(!bk.empty()){
                    ans.push_back(bk.back());
                    bk.pop_back();
                }
                break;
            }
        }
        for(int i = 0; i < n; i++){
            cout << ans[i] << " \n"[i + 1 == n];
        }
    }

}