#include<iostream>
#include<string>
#include<cstdio>
#include<vector>
#include<cmath>
#include<algorithm>
#include<functional>
#include<iomanip>
#include<queue>
#include<ciso646>
#include<random>
#include<map>
#include<set>
#include<bitset>
#include<stack>
#include<unordered_map>
#include<utility>
#include<cassert>
#include<complex>
#include<numeric>
using namespace std;

//#define int long long
typedef long long ll;

typedef unsigned long long ul;
typedef unsigned int ui;
constexpr ll mod = 1000000007;
const ll INF = mod * mod;
typedef pair<int, int>P;
#define stop char nyaa;cin>>nyaa;
#define rep(i,n) for(int i=0;i<n;i++)
#define per(i,n) for(int i=n-1;i>=0;i--)
#define Rep(i,sta,n) for(int i=sta;i<n;i++)
#define rep1(i,n) for(int i=1;i<=n;i++)
#define per1(i,n) for(int i=n;i>=1;i--)
#define Rep1(i,sta,n) for(int i=sta;i<=n;i++)
#define all(v) (v).begin(),(v).end()
typedef pair<ll, ll> LP;
typedef long double ld;
typedef pair<ld, ld> LDP;
const ld eps = 1e-12;
const ld pi = acos(-1.0);

ll mod_pow(ll x, ll n, ll m) {
	ll res = 1;
	while (n) {
		if (n & 1)res = res * x % m;
		x = x * x % m; n >>= 1;
	}
	return res;
}
struct modint {
	ll n;
	modint() :n(0) { ; }
	modint(ll m) :n(m) {
		if (n >= mod)n %= mod;
		else if (n < 0)n = (n % mod + mod) % mod;
	}
	operator int() { return n; }
};
bool operator==(modint a, modint b) { return a.n == b.n; }
modint operator+=(modint& a, modint b) { a.n += b.n; if (a.n >= mod)a.n -= mod; return a; }
modint operator-=(modint& a, modint b) { a.n -= b.n; if (a.n < 0)a.n += mod; return a; }
modint operator*=(modint& a, modint b) { a.n = ((ll)a.n * b.n) % mod; return a; }
modint operator+(modint a, modint b) { return a += b; }
modint operator-(modint a, modint b) { return a -= b; }
modint operator*(modint a, modint b) { return a *= b; }
modint operator^(modint a, int n) {
	if (n == 0)return modint(1);
	modint res = (a * a) ^ (n / 2);
	if (n % 2)res = res * a;
	return res;
}

ll inv(ll a, ll p) {
	return (a == 1 ? 1 : (1 - p * inv(p % a, a)) / a + p);
}
modint operator/(modint a, modint b) { return a * modint(inv(b, mod)); }

const int max_n = 1 << 19;
modint fact[max_n], factinv[max_n];
void init_f() {
	fact[0] = modint(1);
	for (int i = 0; i < max_n - 1; i++) {
		fact[i + 1] = fact[i] * modint(i + 1);
	}
	factinv[max_n - 1] = modint(1) / fact[max_n - 1];
	for (int i = max_n - 2; i >= 0; i--) {
		factinv[i] = factinv[i + 1] * modint(i + 1);
	}
}
modint comb(int a, int b) {
	if (a < 0 || b < 0 || a < b)return 0;
	return fact[a] * factinv[b] * factinv[a - b];
}

typedef vector<vector<ll>> mat;
typedef vector<ll> vec;
mat A = { { (ll)1,(ll)1 },{ (ll)1,(ll)0 } };
mat mtmul(mat& A, mat& B) {
	mat C(A.size(), vec(B[0].size()));
	rep(i, (int)A.size()) {
		rep(k, (int)B.size()) {
			rep(j, (int)B[0].size()) {
				C[i][j]+=A[i][k] * B[k][j];
			}
		}
	}
	return C;
}

mat mt100[100];
void init() {
	mt100[0] = { {1,0},{0,1} };
	rep(i, 99) {
		mt100[i + 1] = mtmul(mt100[i], A);
	}
}
void solve() {
	ll x, y; cin >> x >> y;
	if (x <= 10 && y <= 10) {
		int ma = 0;
		int ans = 0;
		rep1(i, x)rep1(j, y) {
			int c = 0;
			int a = i, b = j;
			if (a < b)swap(a, b);
			while (b) {
				int r = a % b; a = b; b = r; c++;
			}
			if (ma < c) {
				ma = c; ans = 1;
			}
			else if (ma == c)ans++;
		}
		cout << ma << " " << ans << "\n";
		return;
	}
	if (x > y)swap(x, y);
	if (x == 1) {
		cout << 1 << " " << y % mod << "\n";
		return;
	}
	int ma = 1;
	for (int ad = 1; ad < 100; ad++) {
		ll val2 = 2 * mt100[ad][0][0] + mt100[ad][0][1];
		ll val1 = 2 * mt100[ad][1][0] + mt100[ad][1][1];
		if (val1 <= x && val2 <= y) {
			ma = ad + 1;
		}
		else break;
	}
	function<ll(ll, ll, int)> dfs = [&](ll a, ll b, int rest)->ll{
		//cout << a << " " << b << " " << rest << "\n";
		if (rest == 1) {
			ll s = a + b;
			ll res = 0;
			res += 1 + (y - s) / b;
			if (s <= x) {
				res += 1 + (x - s) / b;
			}
			return res % mod;
		}
		else {
			ll s = a + b;
			if (a == 0)s = 2;
			ll res = 0;
			while (true) {
				ll val1 = s * mt100[rest - 1][1][0] +  b* mt100[rest - 1][1][1];
				ll val2 = s * mt100[rest - 1][0][0] + b * mt100[rest - 1][0][1];
				if (val1 <= x && val2 <= y) {
					res += dfs(b, s, rest - 1);
					if (res >= mod)res -= mod;
				}
				else break;
				s += b;
			}
			return res;
		}
	};
	ll ans = dfs(0, 1, ma);
	cout << ma<<" "<<ans << "\n";
}




signed main() {
	ios::sync_with_stdio(false);
	cin.tie(0);
	//cout << fixed << setprecision(10);
	//init_f();
	//cout << grandy(2, 3, false, false) << "\n";
	init();
	int t; cin >> t; rep(i, t)
	solve();
	return 0;
}


Measured memory_bytes: 12560