#include <bits/stdc++.h>

using namespace std;
#define ll long long
#define pii pair<int, int>
#define ld long double
#define all(a) (a).begin(), (a).end()

const int T = 18;
vector<int> prm;

const int MAXN = 1e6 + 100;
int mn[MAXN];
int64_t mlt[1 << T];
int ind[1 << T], sz[1 << T];
int val[1 << T];

int perfect_sqrt(int n) {
    int res = sqrt(n);
    while (res * res > n) --res;
    while ((res + 1) * (res + 1) <= n) ++res;
    return res;
}

int maxslow = 0;

map<array<int, 2>, vector<int>> mem;

void solve() {
    int n, k;
    cin >> n >> k;
    /// n = abs(rand()) % 500 + 20, k = n % 2 + 2 * abs(rand()) % (min(n / 2, 10));
    if ((n - k) % 2 != 0) {
        cout << "-1\n";
        return;
    }
    if (mem.count({n, k})) {
        for (int x : mem[{n, k}]) {
            cout << x << " ";
        }
        cout << "\n";
        return;
    }

    int val = perfect_sqrt(n) + 1;
    int lft = (n - k) / 2;
    vector<int> ans;
    for (int p : prm) {
        if (p < val) continue;
        if (p > n) break;
        int x = (n / p);
        if (lft >= x) {
            lft -= x;
            ans.push_back(p);
        }
    }
    if (lft == 0) {
        vector<int> out(n + 1, 1);
        int id = 0;
        for (int i = 2; i <= n; ++i) {
            if (id < (int)ans.size() && i == ans[id]) {
                out[i] = -1;
                ++id;
            } else if (mn[i] == i) {
                out[i] = 1;
            } else {
                out[i] = out[mn[i]] * out[i / mn[i]];
            }
        }
        mem[{n, k}] = out;
        for (int i = 1; i <= n; ++i) {
            cout << out[i] << " ";
        }
        cout << "\n";
        return;
    }
    /// cerr << "slow: " << n << " " << k << endl;
    /// maxslow = max(maxslow, n);
    /// cerr << maxslow << endl;

    /**for (int mask = 0; mask < (1 << T); ++mask) {
        val[mask] = 1;
        if (sz[mask] % 2 == 1) {
            val[mask] = -val[mask];
        }
        val[mask] *= perfect_sqrt(n / mlt[mask]);
    }
    for (int l = 1; l < (1 << T); l *= 2) {
        for (int j = 0; j < (1 << T); j += 2 * l) {
            for (int k = 0; k < l; ++k) {
                val[j + k + l] += val[j + k];
            }
        }
    }
    for (int i = 0; i < (1 << T); ++i) {
        if (val[i] == k) {
            vector<int> ans;
            for (int j = 0; j < T; ++j) {
                if (i & (1 << j)) {
                    ans.push_back(prm[j]);
                }
            }
            vector<int> out(n + 1, 1);
            int id = 0;
            for (int i = 2; i <= n; ++i) {
                if (id < (int)ans.size() && i == ans[id]) {
                    out[i] = -1;
                    ++id;
                } else if (mn[i] == i) {
                    out[i] = 1;
                } else {
                    out[i] = out[mn[i]] * out[i / mn[i]];
                }
            }
            for (int i = 1; i <= n; ++i) {
                cout << out[i] << " ";
            }
            cout << "\n";
            return;
        }
    }*/
    for (int mask = 0; mask < (1 << T); ++mask) {
        vector<int> ans;
        for (int j = 0; j < T; ++j) {
            if (mask & (1 << j)) {
                ans.push_back(prm[j]);
            }
        }
        vector<int> out(n + 1, 1);
        int id = 0;
        int sum = 1;
        for (int i = 2; i <= n; ++i) {
            if (id < (int)ans.size() && i == ans[id]) {
                out[i] = -1;
                ++id;
            } else if (mn[i] == i) {
                out[i] = 1;
            } else {
                out[i] = out[mn[i]] * out[i / mn[i]];
            }
            sum += out[i];
        }
        if (sum != k) continue;
        mem[{n, k}] = out;
        for (int i = 1; i <= n; ++i) {
            cout << out[i] << " ";
        }
        cout << "\n";
        return;
    }
    /// cerr << "bad!! " << n << " " << k << endl;
    /// exit(0);
}

signed main() {
    ios_base::sync_with_stdio(0);
    cin.tie(0);
    cout.tie(0);

    for (int i = 2; i < MAXN; ++i) {
        if (mn[i] == 0) {
            mn[i] = i;
            prm.push_back(i);
        } 
        for (int p : prm) {
            if (p > i || i * p >= MAXN) break;
            mn[i * p] = p;
        }
    }

    mlt[0] = 1;
    for (int i = 1; i < (1 << T); ++i) {
        for (int j = 0; j < T; ++j) {
            if (i & (1 << j)) {
                ind[i] = j;
                mlt[i] = mlt[i ^ (1 << j)] * prm[j];
                sz[i] = sz[i ^ (1 << j)] + 1;
                break;
            }
        }
    }

    int tst;
    cin >> tst;
    while (tst--) {
        solve();
    }

    return 0;
}