#include <iostream>
#include <vector>
#include <cmath>

using namespace std;
/*
#include <atcoder/all>
using namespace atcoder;
using mint = modint1000000007;
*/
#define all(x) (x).begin(),(x).end()
#define rep(i, n) for (int i = 0; i < (n); i++)
#define endl "\n"

#pragma GCC optimize("O3")
#pragma GCC optimize("unroll-loops")

typedef long long ll;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;

template <typename T> ostream &operator<<(ostream &os, const vector<T> &vec) {os << "["; for (const auto &v : vec) {os << v << ","; } os << "]"; return os;}
template <typename T, typename U> ostream &operator<<(ostream &os, const pair<T, U> &p) {os << "(" << p.first << ", " << p.second << ")"; return os;}
ll mod_pow(ll a, ll n, ll mod) { ll ret = 1; ll p = a % mod; while (n) { if (n & 1) ret = ret * p % mod; p = p * p % mod; n >>= 1; } return ret; }

const int mod = 1e9 + 7;

ll solve(ll a, ll b) {
    ll x = (ll)(sqrt((double)a) + sqrt((double)b) + 0.5);
    for (ll ans = x - 1; ans <= x + 1; ans++) {
        ll t = ans * ans - a - b;
        if (4 * a * b < t * t && t > 0) {
            return ans;
        }
    }
    return 0;
}

void solve() {
    // 4AB < (X^2 - A - B)^2 && X^2 - A - B > 0
    int Q; cin >> Q;
    for (int i = 0; i < Q; i++) {
        ll a, b; cin >> a >> b;
        cout << solve(a, b) << endl;
    }
}

int main() {
    #ifdef LOCAL_ENV
    cin.exceptions(ios::failbit);
    #endif
    cin.tie(0);
    ios::sync_with_stdio(false);
    cout.setf(ios::fixed);
    cout.precision(16);
    
    solve();
}