//Author: Kevin
#include<bits/stdc++.h>
//#pragma GCC optimize("O2")
using namespace std;
#define ll long long
#define ull unsigned ll
#define pb emplace_back
#define mp make_pair
#define ALL(x) (x).begin(),(x).end()
#define rALL(x) (x).rbegin(),(x).rend()
#define srt(x) sort(ALL(x))
#define rev(x) reverse(ALL(x))
#define rsrt(x) sort(rALL(x))
#define sz(x) (int)(x.size())
#define inf 0x3f3f3f3f
#define pii pair<int,int>
#define lb(v,x) (int)(lower_bound(ALL(v),x)-v.begin())
#define ub(v,x) (int)(upper_bound(ALL(v),x)-v.begin())
#define uni(v) v.resize(unique(ALL(v))-v.begin())
#define longer __int128_t
void die(string S){puts(S.c_str());exit(0);}
const ll mod=1e9+7;
ll solve(ll a,ll b)
{
	if(!a) return 0;
	if(a<0)
	{
		ll x=(-a+b-1)/b;
		a+=x*b;
		return (solve(a,b)+x)%mod;
	}
	if(a>=b-a&&b>a)
	{
		ll x=a/(b-a);
		ll tmp=b-a;
		a-=x*tmp;
		b-=x*tmp;
		return (solve(a,b)+3*x)%mod;
	}
	return (solve(-b,a)+1)%mod;
}
int main()
{
	ios_base::sync_with_stdio(false);
	cin.tie(0);
	cout.tie(0);
	int t;
	cin>>t;
	while(t--)
	{
		ll a,b;
		cin>>a>>b;
		cout<<solve(a,b)<<'\n';
	}
	return 0;
}