import std.algorithm, std.container, std.conv, std.math, std.range, std.typecons, std.stdio, std.string;

auto rdsp(){return readln.splitter;}
void pick(R,T)(ref R r,ref T t){t=r.front.to!T;r.popFront;}
void readV(T...)(ref T t){auto r=rdsp;foreach(ref v;t)pick(r,v);}

void main()
{
  int q; readV(q);

  foreach (_; 0..q) {
    long a, b; readV(a, b);

    if (a > b) swap(a, b);

    if (a == b) {
      writeln(a*2-2);
    } else {
      auto c = nsqrt(a*b-1);
      if (c*(c+1) >= a*b)
        writeln(c*2-2);
      else
        writeln(c*2-1);
    }
  }
}

pure T nsqrt(T)(T n)
{
  import std.algorithm, std.conv, std.range, core.bitop;
  if (n <= 1) return n;
  T m = T(1) << (n.bsr/2+1);
  return iota(1, m).map!"a * a".assumeSorted!"a <= b".lowerBound(n).length.to!T;
}
