#include<bits/stdc++.h>
using namespace std;
#define int long long
#define fast ios::sync_with_stdio(false),cin.tie(0),cout.tie(0)
#define For(i,aa,ac) for(int i=aa;i<=ac;i++)
int n,m;
const int N=2e6+7;
int f[N];
void solve(){
    cin>>m>>n;
    int s1[5000];
    int s2[5000];
    int c1=0;
    int c2=0;
    int cnt=3;
    while(n>0){
        int tmp=n%cnt;
        s1[++c1]=tmp;
        n/=3;
    }
    cnt=3;
    while(m>0){
        int tmp=m%cnt;
        s2[++c2]=tmp;
        m/=3;
    }
    if(c1!=c2){
        int sum=0;
        int sum1=0;
        sum+=c1;
        for(int i=1;i<=c1;i++){
            sum+=s1[i];
        }
        if(s1[c1]==2){
            sum1=1+c1+(c1-1)*2;
        }else{
            sum1=c1-1+(c1-1)*2;
        }
        cout<<max(sum,sum1)<<endl;
    }else{
        int sum=c1;
        int cn=0;
        int sum1=c1;
        int sum2=c2;
        for(int i=c2;i>=1;i--){
            sum1+=s1[i];
            sum2+=s2[i];
        }
        for(int i=c2;i>=1;i--){
            if(s1[i]!=s2[i]){
                cn=i;
                break;
            }
        }
        //cout<<c2<<"!"<<cn<<endl;
        for(int i=c2;i>=cn+1;i--){
            sum+=s1[i];
        }
        sum+=s1[cn]-1;
        sum+=(cn-1)*2;
        cout<<max(sum,max(sum1,sum2))<<endl;
    }
}
signed main(){
    fast;
    int t=1;
    cin>>t;
    while(t--){
        solve();
    }
}