#include <iostream>
#include <cmath>
#include <stack>
#include <iomanip>
#include <limits>
#include <queue>
#include <map>
#include <set>
#include<algorithm>
#include<deque>
using namespace std;
#define rep(i, n) for (int i = 0;i < (n); ++i)
#define Yes cout << "Yes" << endl
#define No cout << "No" << endl
#define vi vector<int>
#define vvi vector<vector<int>>
#define vl vector<long long> 
#define vvl vector<vector<long long>>
#define vs vector<string>
#define vc vector<char>
#define vvc vector<vector<char>>
#define vb vector<bool>
#define vvb vector<vector<bool>> 
using ll = long long;
using P = pair<ll,ll>;
void chmin(ll &a,ll b){
    a = min(a,b);
}
void chmax(int &a,int b){
    a = max(a,b);
} 

const ll INF = 2e18;

int main(){
    ios_base::sync_with_stdio(false);
    cin.tie(nullptr);
    int t;
    cin >> t;
    rep(i,t){
        ll n,m;
        cin >> n >> m;
        ll mm = 0;ll mn = 0;
        if(m%4 == 0)mm = m/4;
        else mm = m/4+1;
        ll can = 4-m%4;
        if(m%4 == 0)can = 0;
        n -= can;
        if(n%4 == 0)mn = n/4;
        else mn = n/4+1;
        if(mn > mm){
            n -= mm*4;
            mn = mm;
            if(n%8 == 0)mn += n/8;
            else mn += n/8+1;
        }
        
        cout << max(mn,mm) << endl;
    } 
}