#include<bits/stdc++.h>
using namespace std;
typedef unsigned long long ull;
ull c[105][105];
ull M=-1;
ull find(int k,ull m){
	ull ans=0;
	int cnt=0;
	for(int i=64;i>=0;i--)if(c[i][k-cnt]<m){
		m-=c[i][k-cnt];
		cnt++;
		ans+=(1ULL<<i);
	}
	return ans;
}
int main(){
	for(int i=0;i<=70;i++){
		c[i][0]=1;
		for(int j=1;j<=i;j++)c[i][j]=c[i-1][j-1]+c[i-1][j];
	}
	int T;
	scanf("%d",&T);
	while(T--){
		ull m;
		int k;
		scanf("%llu%d",&m,&k);
		if(c[64][k-1]<m){
			printf("0 0\n");
			continue;
		}
		ull l=find(k-1,m);
		if(c[64][k-1]<m+1){
			printf("%llu %llu\n",l+1,-l-1);
			continue;
		}
		ull r=find(k-1,m+1);
		printf("%llu %llu\n",l+1,r-l);
	}
	return 0;
}