#include <bits/stdc++.h>
using namespace std;
int main() {
  int T;
  cin >> T;
  while (T--) {
    int N;
    long long X;
    cin >> N >> X;
    if (N == 1) {
      cout << X << endl;
      continue;
    }
    long long l = N - 1, r = X;
    long long mn = X;
    while (l <= r) {
      long long mid = l + (r - l) / 2;
      /**
      if (mid / 2 > X / (mid + 1)) {
        r = mid - 1;
        continue;
      }
      **/
      long long sum = 0;
      long long a = mid;
      for (int i = 0; i < N - 1; i++) {
        sum += a;
        if (sum > X) {
          r = mid - 1;
          goto next;
        }
        a--;
      }
      if (X - sum > mid) {
        l = mid + 1;
        mn = min(mid, mn);
      } else {
        r = mid - 1;
      }
    next:;
    }
    if (mn == X) {
      cout << -1 << endl;
    } else {
      long long sum = 0;
      vector<long long> ans(N);
      for (int i = 1; i < N; i++) {
        ans[i] = mn;
        sum += mn;
        mn--;
      }
      ans[0] = X - sum;
      for (int i = 0; i < N; i++) {
        cout << ans[i] << " \n"[i == N - 1];
      }
    }
  }
  return 0;
}
// A1 wo dekirudake tiisaku suru
// A2 wo dekirudake ookiku sureba
// m * x <= inf
// iku junban
// 1 -> N - 1 -> N -> 1
// 1 -> N -> N - 1 -> 1