#include <bits/stdc++.h>
#define int long long
#define all(a) begin(a), end(a)
using namespace std;


void solve() {
	int n, m; cin >> n >> m;

	vector<int> ans;
	ans.push_back(0); ans.push_back((1LL << n) - 1);
	for (int i = 0; i < n; i++) {
		for (int j = i; j < n; j++) {
			int val = 0;
			for (int k = i; k <= j; k++) {
				val += 1LL << k;
			}
			if (val == (1LL << n) - 1) continue;
			if (ans.size() < m) {
				ans.push_back(val);
			}
		}
	}
	sort(ans.begin(), ans.end());
	assert(ans.size() == m);
	assert(ans[0] == 0);
	assert(ans.back() == (1LL << n) - 1);
	for (int i = 0; i < ans.size(); i++) {
		for (int j = 0; j < ans.size(); j++) {
			assert(binary_search(all(ans), ans[i] & ans[j]));
			assert(binary_search(all(ans), ans[i] | ans[j]));
		}
	}
	for (auto x : ans) {
		cout << x << ' ';
	}
	cout << '\n';
}

int32_t main(){
#ifndef LOCAL
	cin.tie(0)->sync_with_stdio(false);
#endif
	int t = 1;
	cin >> t;
	while (t--) {
		solve();
	}
}