#include <iostream>

using namespace std;
using ll = long long;

ll solve (int A, int B) {
    auto f = [&](ll x) -> bool {
        return 4LL * A * B - 1LL * (A+B) * (A+B) < x*x*x*x - 2*x*x*(A+B);
    };

    ll ok = 65000, ng = 0;
    while (1 < abs(ok-ng)) {
        ll mid = (ok + ng) / 2;
        if (f(mid)) {
            ok = mid;
        }
        else {
            ng = mid;
        }
    }

    return ok;
}

int main () {
    int N; cin >> N;
    // 二回2乗してやれば二分探索できそうな形になる(った)

    while (N--) {
        int A, B; cin >> A >> B;

        auto ans = solve(A, B);
        cout << ans << "\n";
    }
}