#include <bits/stdc++.h>
#define ll long long
#define ull unsigned long long
#define m_p make_pair
#define m_t make_tuple
#define N 55
using namespace std;
ll p2[N];
ll getbrk(ll l, ll r, ll les) // get best rank of x
{
	if (l == r)
		return l;
	ll mid = l + r >> 1;
	if (les)
		return getbrk(l, mid, (les - 1) >> 1);
	return getbrk(mid + 1, r, 0);
}
signed main()
{
	ios::sync_with_stdio(false);
	cin.tie(nullptr);
	cout.tie(nullptr);
	int T;
	cin >> T;
	ll n, p, l, r, ans, mid;
	p2[0] = 1;
	for (int i = 1; i < N; i++)
		p2[i] = p2[i - 1] * 2ll;
	for (int zzz = 1; zzz <= T; zzz++)
	{
		cin >> n >> p;
		// cout << "Case #" <<zzz<< ": ";
		if (p == p2[n])
			cout << p2[n] - 1 << " " << p2[n] - 1;
		else if (p == 1)
			cout << "0 0";
		else if (p <= p2[n - 1])
		{
			cout << "0 ";
			ans = 1;
			l = 1;
			r = p2[n] - 1;
			while (l <= r)
			{
				mid = l + r >> 1;
				if (getbrk(1, p2[n], p2[n] - mid) <= p)
				{
					l = mid + 1;
					ans = mid;
				}
				else
					r = mid - 1;
			}
			cout << ans - 1;
		}
		else
		{
			p = p2[n] - p;
			ans = 1;
			l = 1;
			r = p2[n] - 1;
			while (l <= r)
			{
				mid = l + r >> 1;
				if (getbrk(1, p2[n], p2[n] - mid) <= p)
				{
					l = mid + 1;
					ans = mid;
				}
				else
					r = mid - 1;
			}
			cout << p2[n] - ans - 1 << " " << p2[n] - 2;
		}
		cout << "\n";
	}
	return 0;
}