#include<bits/stdc++.h>
 
using namespace std;
 
vector<long long> maximizeSetBits(int n, long long k)
{
	if(n==1)
	{
		return {k};
	}
	vector<long long> answer(n, 0);
	long long base = log2(k);
	answer[0] = (1ll<<base)-1;
	answer[1] = k - answer[0];
	return answer;
}
 
int main()
{
	int t;
	while(t--)
	{
		int n;
		long long k;
		cin >> n >> k;
		vector<long long> answer = maximizeSetBits(n, k);
		for(long long num: answer)
		{
			cout << num << " ";
		}
		cout << endl;
	}
	return 0;
}

I2luY2x1ZGU8Yml0cy9zdGRjKysuaD4KCnVzaW5nIG5hbWVzcGFjZSBzdGQ7Cgp2ZWN0b3I8bG9uZyBsb25nPiBtYXhpbWl6ZVNldEJpdHMoaW50IG4sIGxvbmcgbG9uZyBrKQp7CglpZihuPT0xKQoJewoJCXJldHVybiB7a307Cgl9Cgl2ZWN0b3I8bG9uZyBsb25nPiBhbnN3ZXIobiwgMCk7Cglsb25nIGxvbmcgYmFzZSA9IGxvZzIoayk7CglhbnN3ZXJbMF0gPSAoMWxsPDxiYXNlKS0xOwoJYW5zd2VyWzFdID0gayAtIGFuc3dlclswXTsKCXJldHVybiBhbnN3ZXI7Cn0KCmludCBtYWluKCkKewoJaW50IHQ7Cgl3aGlsZSh0LS0pCgl7CgkJaW50IG47CgkJbG9uZyBsb25nIGs7CgkJY2luID4+IG4gPj4gazsKCQl2ZWN0b3I8bG9uZyBsb25nPiBhbnN3ZXIgPSBtYXhpbWl6ZVNldEJpdHMobiwgayk7CgkJZm9yKGxvbmcgbG9uZyBudW06IGFuc3dlcikKCQl7CgkJCWNvdXQgPDwgbnVtIDw8ICIgIjsKCQl9CgkJY291dCA8PCBlbmRsOwoJfQoJcmV0dXJuIDA7Cn0=

NAoxIDUKMiAzCjIgNQo2IDUx

4
1 5
2 3
2 5
6 51