#include<bits/stdc++.h>
#include <iostream>
#include <algorithm>
#include <atcoder/all>
#include<math.h>
using namespace std;
using namespace atcoder;
using mint=modint998244353;
typedef long long ll;
using Graph=vector<vector<ll>>;
typedef pair<ll, ll> PLL;
typedef vector<int> VI;
typedef vector<char> VC;
typedef vector<double> VD;
typedef vector<double> VL;
typedef vector<string> VS;
typedef vector<PLL> VP;
typedef vector<ll> VLL;
typedef vector<bool> VB;
const static ll inf = 1000000000;
const static ll mod = 1000000007;
template <typename T> bool chmax(T& a, const T& b) { if (a < b) { a = b; return true; } return false; }
template <typename T> bool chmin(T& a, const T& b) { if (a > b) { a = b; return true; } return false; }
#define YesNo(bool) if(bool) cout<<"Yes"<<endl; else cout<<"No"<<endl;
#define rep(i,n) for (ll i=0; i<(ll)(n); i++)
#define repd(i,n) for (ll i=n-1; i>=0; i--)
#define rept(i,m,n) for(ll i=m; i<n; i++)
#define stl_rep(itr, x) for (auto itr = x.begin(); itr != x.end(); ++itr)
#define all(x) (x).begin(), (x).end()
#define F first
#define S second
#define pf push_front
#define pb push_back
#define eb emplace_back
#define pi 3.141592653589793
#define swap_str(s,a,b) regex_replace(s,regex(a),b)
#define sor(vec) sort(vec.begin(), vec.end())
#define rever(vec) reverse(vec.begin(), vec.end())
#define paired make_pair
#define PRINT(V) for(auto v : (V)) cout << v << " "
#define Yes cout<<"Yes"<<endl
#define No cout<<"No"<<endl
#define fix cout << fixed << setprecision(16);
#define vvl vector<vector<ll>>
#define vvs vector<vector<string>>
#define elif else if

int main() {
  ll n;
  cin>>n;
  VD a(n),b(n);
  rep(i,n) cin>>a[i]>>b[i];
  VD num;
  rep(i,n) num.pb(sqrt(a[i])+sqrt(b[i]));
  for(auto a:num) cout<<floor(a+1)<<endl;





}