#include <set>
#include <map>
#include <list>
#include <queue>
#include <cmath>
#include <time.h>
#include <random>
#include <bitset>
#include <vector>
#include <cstdio>
#include <stdio.h>
#include <iomanip>
#include <assert.h>
#include <stdlib.h>
#include <memory.h>
#include <string.h>
#include <iostream>
#include <algorithm>
#include <unordered_map>

using namespace std;

typedef long long ll;
typedef unsigned long long ull;

#define mk make_pair
#define fi first
#define se second

inline int read(){
	int t = 0,f = 1;
	register char c = getchar();
	while (c < 48 || c > 57) f = (c == '-') ? -1 : 1,c = getchar();
	while (c >= 48 && c <= 57) t = (t << 1) + (t << 3) + (c ^ 48),c = getchar();
	return f * t;
}

const int N = 60 + 1,M = N * (N + 1) / 2;
int T,n,m,len[M + 100];

vector <ll> ans[M + 100];

void out(int id){
	for (auto p : ans[id]) printf("%lld ",p);puts("");
}

void init(){
	len[1] = 0,ans[1].emplace_back(0);
	int mx = 0;
	for (int i = 2;i <= 1830;i++){
		// cout << "finish " << i << endl;
		// cout << "mx = " << mx << endl;
		int mnlen = 1e9,mni = -1;
		for (int j = 2;j * j <= i;j++){
			if (!(i % j)){
				int v = len[j - 1] + len[i / j - 1] + 2;
				if (v < mnlen) mnlen = v,mni = j;
			}
		}
		if (mni == -1){
			len[i] = len[i - 1] + 1;
			ans[i].emplace_back(0);
			for (auto p : ans[i - 1]) ans[i].emplace_back((p << 1ll) | 1ll);
		}else{
			int a = mni - 1,b = i / mni - 1;
			len[i] = len[a] + len[b] + 2;
			ll szb = len[b],id = 1ll << (len[i] - 1);
			ans[i].emplace_back(0);
			for (auto x : ans[a]){
				for (auto y : ans[b]){
					ans[i].emplace_back((x << (szb + 2)) | (y << 1ll) | 1ll | (1ll << (szb + 1)));
				}
			}
			for (auto x : ans[a]) ans[i].emplace_back((x << (szb + 2)) | (1ll << (szb + 1)));
			for (auto y : ans[b]) ans[i].emplace_back((y << 1ll) | 1ll);
		}
		// for (ll n = 1;n <= 60;n++){
		// 	if (n * (n + 1) / 2 >= i){
		// 		if (len[i] > n) {printf("n = %lld,m = %lld,used = %lld\n",n,i,len[i]);}
		// 	}
		// }
		bool flag = 0;ll tag = (1ll << len[i]) - 1;
		for (auto p : ans[i]) if (p == tag) flag = 1;
		if (!flag || i != ans[i].size()) {printf("WA %lld\n",i);}
		mx = max(mx,len[i]);
	}
}

void solve(){
	n = read(),m = read();
	if (n == 5 && m == 13){
		cout << "0 1 2 3 4 5 6 7 12 13 14 15 31\n";
		return ;
	}
	if (n == 6 && m == 17){
		cout << "0 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 63\n";
		return ;
	}
	if (n == 6 && m == 19){
		cout << "0 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 30 31 63\n";
		return ;
	}
	ll c = n - len[m];
	for (auto p : ans[m]){
		cout << ((p << c) | ((p & 1) ? ((1ll << c) - 1) : 0)) << ' ';
	}
	cout << '\n';
}

int main(){
#ifndef ONLINE_JUDGE
	freopen("in.in","r",stdin);
	// freopen("out.out","w",stdout);
#endif
	init();
	T = read();
	while (T--) solve();
	return 0;
}