#include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for(int i=0; i<(int)n; i++)
#define repi(i,m,n) for(int i=(int)m; i<=(int)n; i++)
#define rrep(i,n) for(int i=(int)n-1; i>=0; i--)
#define rrepi(i,m,n) for(int i=(int)n; i>=(int)m; i--)
#define all(x) x.begin(),x.end()
template <typename T> inline bool chmin(T& a, const T& b) { return a > b ? a = b, true : false; };
template <typename T> inline bool chmax(T& a, const T& b) { return a < b ? a = b, true : false; };
template <typename T> void uniq(std::vector<T> &v){
    std::sort(v.begin(),v.end());
    v.erase(unique(v.begin(),v.end()),v.end());
}
using ll = long long;

int main(){
    int n; cin >> n;
    while(n--){
        ll a,b; cin >> a >> b;
        __int128_t ng = sqrt(a+b), ok = 1e5;
        while(ok-ng>1){
            __int128_t mid = (ok+ng)/2;
            if((mid*mid - a - b)*(mid*mid - a - b) > 4*a*b) ok = mid;
            else ng = mid;
        }
        cout << (ll)ok << endl;
    }

    return 0;
}