#include <iostream>
#include <string>
#include <vector>
#include <algorithm>
#include <utility>
#include <map>
#include <set>
#include <queue>
#include <iomanip>
#include <cmath>
#include <atcoder/all>
using namespace std;
using namespace atcoder;
typedef long long ll;
#define rep(i,n) for (int i = 0; i < int(n);i++)

void solve(){
	ll a,b;
	cin >> a >> b;
	ll ok = 1e18;
	ll ng = a+b;
	while(ok-ng > 1LL){
		ll mid = (ok+ng)/2;
		if (mid-a-b < 0){
			ng = mid;
			continue;
		}
		else if (4*a*b/(mid-a-b) < (mid-a-b)){
			ok = mid;
			continue;
		}
		else{
			ng = mid;
			continue;
		}
	}
	ll ans = round(sqrtl(ok));
	if (ans*ans < ok) ans++;
	cout << ans << endl;
	//cout << round(sqrtl(ok)) << endl;
}
int main(){
	int tt;
	cin >> tt;
	while(tt--){
		solve();
	}
	
	
	return 0;
}