#include <iostream>
#include <iomanip>
#include <vector>
#include <algorithm>
#include <utility>
#include <string>
#include <queue>
#include <stack>
#include <unordered_map>

using namespace std;

typedef long long int ll;
typedef pair<int, int> Pii;

const ll mod = 998244353;

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

  int n;
  cin >> n;
  vector<pair<ll, ll>> ab(n);
  for (auto &x: ab) cin >> x.first >> x.second;

  vector<ll> ans;
  for (int i = 0; i < n; i++) {
    auto &[a, b] = ab[i];
    ll ng = 0;
    ll ok = 54772;
    while (abs(ng - ok) > 1) {
      ll mid = (ng + ok) / 2;
      ll x2ab = (mid * mid - a - b);
      ll x2ab2 = x2ab * x2ab;
      if (x2ab >= 0 && a * b * 4 < x2ab2) ok = mid;
      else ng = mid;
    }
    ans.push_back(ok);
  }

  for (auto &x: ans) cout << x << endl;

  return 0;
}