#include <cmath>
#include <cstdio>
#include <vector>
#include <iostream>
#include <queue>
#include <algorithm>
using namespace std;
int main() {
int t;
cin>>t;
while(t--){
long long n,m;
cin>>n>>m;
int f=1;
long long l,h;
priority_queue <int> gg;
gg.push(n);
for(int i=0;i<m;i++){
if((gg.top()-1)%2==1){
l=((gg.top()-1)/2);
h=((gg.top()-1)/2)+1;
}
else{
l=((gg.top()-1)/2);
h=((gg.top()-1)/2);
}
gg.pop();
gg.push(l);
gg.push(h);
if(l==0&&h==0){
cout<<h<<" "<<l<<endl;
f=0;
break;
}
}
if(f)
cout<<h<<" "<<l<<endl;
}
return 0;
}
I2luY2x1ZGUgPGNtYXRoPgojaW5jbHVkZSA8Y3N0ZGlvPgojaW5jbHVkZSA8dmVjdG9yPgojaW5jbHVkZSA8aW9zdHJlYW0+CiNpbmNsdWRlIDxxdWV1ZT4KI2luY2x1ZGUgPGFsZ29yaXRobT4KdXNpbmcgbmFtZXNwYWNlIHN0ZDsKCmludCBtYWluKCkgewoKCWludCB0OwoJY2luPj50OwoKCXdoaWxlKHQtLSl7CgoJbG9uZyBsb25nIG4sbTsKCWNpbj4+bj4+bTsKCglpbnQgZj0xOwoKCWxvbmcgbG9uZyBsLGg7CgoJcHJpb3JpdHlfcXVldWUgPGludD4gZ2c7CglnZy5wdXNoKG4pOwoKCWZvcihpbnQgaT0wO2k8bTtpKyspewoKCQlpZigoZ2cudG9wKCktMSklMj09MSl7CgkJCWw9KChnZy50b3AoKS0xKS8yKTsKCQkJaD0oKGdnLnRvcCgpLTEpLzIpKzE7CgoJCQl9CgoJCWVsc2V7CgoJCQlsPSgoZ2cudG9wKCktMSkvMik7CgoJCQloPSgoZ2cudG9wKCktMSkvMik7CgoJCQl9CgoJCWdnLnBvcCgpOwoJCWdnLnB1c2gobCk7CgkJZ2cucHVzaChoKTsKCgkJaWYobD09MCYmaD09MCl7CgkJY291dDw8aDw8IiAiPDxsPDxlbmRsOwoJCWY9MDsKCQlicmVhazsKCQkJCgkJfQoKCX0KCglpZihmKQoJY291dDw8aDw8IiAiPDxsPDxlbmRsOwoKfQoKcmV0dXJuIDA7Cn0=