#include<bits/stdc++.h>
#define AC return 0;
#define int long long 
#define pii pair<int,int>
#define all(tar) tar.begian(),tar.end()
const int N=1e6+5;
const int mod=998244353; 
using namespace std;
int n,m,t;
int a[N],fac[N],ifc[N],jc[N];

void solve(){
  cin>>n>>m;
  while(n>1&&m){
     n=(n+1)/2;m--; 
  }
  cout<<n<<'\n';
}
signed main(){
   ios::sync_with_stdio(false);
   cin.tie(0);
   cout.tie(0);
   //cout<<19*qpow(8,mod-2)%mod<<endl;
   cin>>t;
  while(t--) solve();
   AC
}