#include <algorithm>
#include <array>
#include <bitset>
#include <cassert>
#include <chrono>
#include <cmath>
#include <complex>
#include <cstdint>
#include <cstring>
#include <ctime>
#include <deque>
#include <iomanip>
#include <iostream>
#include <iterator>
#include <map>
#include <numeric>
#include <queue>
#include <random>
#include <set>
#include <stack>
#include <unordered_map>
#include <unordered_set>

void solve() {
  int n;
  long long x;
  std::cin >> n >> x;
  long long least = (n + 1) * n / 2;
  if (x < least) {
    std::cout << -1 << '\n';
    return;
  }

  long long l = 1, r = x / n;
  while (l < r) {
    long long mid = (l + r) / 2;
    if ((mid + mid + n - 1) * n / 2 >= x) {
      r = mid;
    } else
      l = mid + 1;
  }
  long long diff = (l + l + n - 1) * n / 2 - x;

  std::vector<long long> ans(n);
  for (int i = n - 1; i >= 0; i--) {
    ans[i] = l++;
  }

  for (int i = n - 1, cnt = 0; i >= 0; i--) {
    if (cnt + 1 > diff) break;
    ans[i] -= 1;
    cnt++;
  }
  for (auto& x : ans) std::cout << x << ' ';
  std::cout << '\n';
}
int main() {
  std::ios_base::sync_with_stdio(false);
  std::cin.tie(nullptr);

  int t = 1;
  std::cin >> t;
  while (t--) {
    solve();
  }
}