#include <bits/stdc++.h>

using std::bitset;
using std::ios;
using std::cin;
using std::cout;
const int N = 2e6 + 5;
const int L = 45;
int low[N], pri[N], f[N], ans[L][L][L];
int pn, T_data, n, k; bool allow[L][L];

const int wrong[7] = {16, 18, 35, 36, 37, 38, 40};

inline void sieve(int lim)
{
    low[1] = 1;
    for (int i = 2; i <= lim; ++i)
    {
        if (!low[i])
        {
            pri[++pn] = i;
            low[i] = i;
        }
        for (int j = 1; j <= pn && 1ll * pri[j] * i <= lim; ++j)
        {
            int k = pri[j] * i;
            low[k] = pri[j];
            if (low[i] == pri[j])
                break ;
        }
    }
}

int main()
{
 //   freopen("L.in", "r", stdin);

    ios::sync_with_stdio(false);
    cin.tie(nullptr);
    cout.tie(nullptr);


    sieve(2e6);
    for (n = 1; n <= 40; ++n)
    {
        int st = 0;
        for (int i = 1; i <= pn && pri[i] <= n; ++i)
            st = i;
        for (int i = 0; i < (1 << st); ++i)
        {
            for (int j = 1; j <= n; ++j)
                f[j] = 1;
            for (int j = 1; j <= st; ++j)
                if (i >> j - 1 & 1)
                {
                    for (int k = pri[j]; k <= n; k *= pri[j])
                        for (int r = k; r <= n; r += k)
                            f[r] *= (-1);
                }
            int cnt = 0;
            for (int j = 1; j <= n; ++j)
                cnt += f[j];
            if (cnt >= 0)
            {
                allow[n][cnt] = true;
                for (int j = 1; j <= n; ++j)
                    ans[n][cnt][j] = f[j];
            }
        }
    }
    cin >> T_data;
    while (T_data--)
    {
        cin >> n >> k;
        if ((n - k) & 1)
            cout << "-1\n";
        else if (n > 40)
        {
            for (int j = 1; j <= n; ++j)
                f[j] = 1;
            int t = (n - k) / 2, ans = 0;
            for (int i = 1; i <= pn && pri[i] <= n; ++i)
                if (pri[i] * pri[i + 1] > n)
                {
                    int temp = (n / pri[i]) - (pri[i] * pri[i] <= n);
                    ans += temp;
                    if (t >= temp)
                    {
                        t -= temp;
                        for (int j = pri[i]; j <= n; j += pri[i])
                            if (j != pri[i] * pri[i])
                            f[j] = -1;
                    }
                }
            assert(t == 0);
            for (int j = 1; j <= n; ++j)
                cout << f[j] << ' ';
            cout << '\n';
        }
        else if (allow[n][k])
        {
            for (int j = 1; j <= n; ++j)
                cout << ans[n][k][j] << ' ';
            cout << '\n';
        }
        else
            cout << "-1" << '\n';
    }
}