#include<bits/stdc++.h>
using namespace std;
int main()
{ int t;
cin>>t;
while(t–)
{
int a,b;
cin>>a>>b;
queue<pair<int,int>> que;
que.push({a-1,b-1});
set<pair<int,int>> vis;
vis.insert({a-1,b-1});
int flag=0;
int k=0;
while(!que.empty())
{
int l=que.size();
for(int i=0;i<l;i++)
{
auto p=que.front();
que.pop();
if(p.first+p.second==0)
{
flag=1;
break;
}
if(!vis.count({abs(p.first-1),abs(p.second-2)}))
que.push({abs(p.first-1),abs(p.second-2)}),vis.insert({abs(p.first-1),abs(p.second-2)});
if(!vis.count({abs(p.first-2),abs(p.second-1)}))
que.push({abs(p.first-2),abs(p.second-1)}),vis.insert({abs(p.first-2),abs(p.second-1)});
}
if(flag)
break;
k++;
}
cout<<k<<endl;
}
}