#include <bits/stdc++.h>

using namespace std;

#define ll long long
#define rep(i, a, n) for (int i = (int)(a); i < (int)(n); i++)
#define rrep(i, n, a) for (int i = (int)(n); i >= (int)(a); i--)

void solve(){
    int n; cin >> n;
    rep(i,0,n){
        int low = 1;
        int high = 70000;
        ll a,b; cin >> a >> b;
        low = sqrt(a+b)-1;
        while(high - low > 0){
            ll mid = (low+high)/2;
            ll val = (mid*mid-(a+b))*(mid*mid-(a+b));
            ll val2 = (mid*mid-(a+b));
            if(val > 4*a*b && val2 > 0){
                high = mid;
            } else {
                low = mid+1;
            }
        }
        cout << low << '\n';
    }
}

int main(){
    ios::sync_with_stdio(false);
    cin.tie(0);
    solve();

    return 0;
}