#include <algorithm>
#include <cstdint>
#include <iostream>
#include <vector>

namespace {
using std::cin;
using std::cout;
using std::int64_t;

const int kN = 1.0e6, kMaxN = kN + 5;
int n, k;
int f[kMaxN];
bool is_prime[kMaxN];
std::vector<int> primes;

void Sieve(int n) {
  std::fill_n(is_prime + 1, n, true), is_prime[1] = false;

  for (int i = 2; i <= n; ++i) {
    if (is_prime[i]) primes.emplace_back(i);

    for (int prime : primes) {
      int j = i * prime;
      if (j > n) break;
      is_prime[j] = false;
      if (i % prime == 0) break;
    }
  }
}

void Solve() {
  cin >> n >> k;
  std::fill_n(f + 1, n, 1);
  int sum = n;

  for (int prime : primes) {
    if (prime > n) break;
    int last = sum;

    for (int i = prime; i <= n; i += prime) {
      sum -= f[i], f[i] = -f[i / prime], sum += f[i];
    }

    if (sum < k || sum > last) {
      for (int i = prime; i <= n; i += prime) {
        sum -= f[i], f[i] = f[i / prime], sum += f[i];
      }
    }
  }

  if (sum != k) {
    cout << "-1\n";
  } else {
    for (int i = 1; i <= n; ++i) cout << f[i] << " ";
    cout << "\n";
  }
}
}  // namespace

int main() {
  cin.tie(nullptr);
  std::ios::sync_with_stdio(false);
  Sieve(kN);
  int t;
  cin >> t;
  while (t--) Solve();
  return 0;
}