#include <bits/stdc++.h>
using namespace std;
using ll = long long;

#include<atcoder/modint>
using namespace atcoder;
using mint=modint998244353;

void solve(){
    ll N,M;
    cin>>N>>M;
    ll B=(N+3)/4;
    ll Z=B*8-N;
    if(M<=Z){
        cout<<B<<endl;
    }
    else{
        cout<<B+(M-Z+7)/8<<endl;
    }
}

int main(){
    
    ios::sync_with_stdio(false);
    cin.tie(nullptr);

    
    ll T;
    cin>>T;
    while(T--)
    solve();
}