#pragma GCC optimize(1)
#pragma GCC optimize(2)
#pragma GCC optimize(3, "Ofast", "inline")

#include <bits/stdc++.h>

#define int long long
#define ld long double
#define i32 int
#define u32 unsigned int
#define i64 long long
#define u64 unsigned long long
#define u27 __int128
#define endl '\n'
#define VI vector<int>
#define VVI vector<VI>
#define rand() RANDOM(GEN)
#define IO ios::sync_with_stdio(false);cin.tie(0);cout.tie(0)
#define CTM (cout<<"Time:"<<static_cast<double>(clock()-START_TIME)/CLOCKS_PER_SEC*1000<<"ms"<<endl)
typedef long long ll;

using namespace std;
random_device SEED;
mt19937_64 GEN(SEED());
uniform_int_distribution<u64> RANDOM(0, numeric_limits<u64>::max());
const clock_t START_TIME = clock();
int calc(int x,int sx) {
    if(x==0) {
        if(sx==0) return 1;
        if(sx==1) return 2;
        return 3;
    } else {
        return x/3+2+sx;
    }
}
signed main() {
#ifndef ONLINE_JUDGE
    freopen(".in", "r", stdin);
    freopen(".out", "w", stdout);
#endif
    IO;
    int tt;
    cin>>tt;
    while(tt--) {
        int ans=0,y=0;
        int l,r;
        cin>>l>>r;
        int a=r,b;
        while(a%3) a--;
        b=r-a;
        int sum=0;
        while(a+b>=l) {
            if(sum>=20) break;
            sum++;
            ans=max(ans,calc(a,b));
            if(b) b--;
            else a-=3,b=2;
        }
        cout<<ans<<endl;
    }
    return 0;
}