#include<bits/stdc++.h>
#ifndef xxx
#define dbg(...) ;
#endif
using namespace std;
template<class T> ostream &operator<<(ostream &o, const vector <T> &v) { bool f=false; for(T i:v) { f?o<<' ':o; o<<(i); f=true; } return o; }
template<class T> void sort(T &v) { std::sort(v.begin(), v.end()); }
template<class T, class C> void sort(T &v, C c) { std::sort(v.begin(), v.end(), c); }
template<class T> void reverse(T &v) { std::reverse(v.begin(), v.end()); }
template<class T> bool is_sorted(T &v) { return std::is_sorted(v.begin(), v.end()); }
template<class T> inline void _min(T &x, const T &y) { x>y?x=y:x; }
template<class T> inline void _max(T &x, const T &y) { x<y?x=y:x; }
istream &operator>>(istream &i, __int128_t &x) { x=0; short f=1; char c=0; while(!isdigit(c)) { if(c=='-')f=-1; c=i.get(); } while(isdigit(c))x=x*10+c-'0', c=i.get(); x*=f; return i; }
ostream &operator<<(ostream &o, __int128_t x) { if(x==0) { o<<0; return o; } bool f=false; string s; if(x<0)f=true, x=-x; while(x)s+=x%10+'0', x/=10; reverse(s); if(f)o<<'-'; o<<s; return o; }
mt19937 mt(time(0));
typedef double db;
typedef long long ll;
typedef unsigned long long ull;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
constexpr int maxn=2e5+5;
constexpr int mod=1e9+7;
constexpr int inf=0x3f3f3f3f;
constexpr ll INF=0x3f3f3f3f3f3f3f3fll;
constexpr double pi=acos(-1.0);
constexpr double eps=1e-9;

pll getPos(ll a)
{
	ll d=sqrtl(2*a)+1.5;
	ll x=(d*d-d-2*a+2)/2;
	ll y=d-x;
	return make_pair(x, y);
}
ll getAns(ll x, ll y)
{
	if(x>=y)return x-y;
	auto [x1, y1]=getPos(x);
	auto [x2, y2]=getPos(y);
	ll ans=0;
	if(x1==x2)
	{
		ans=y2-y1;
	}
	else if(x1<x2)
	{
		ans=2*(x2-x1)+y2-y1;
	}
	else
	{
		ll k1=x1+y1-1;
		ll k2=x2+y2-1;
		ans=(k2-k1+1)*2+y1+k2-y2;
		_min(ans,y1+getAns(x-y1,y));
	}
	return ans;
}
int main()//MARK: main
{
#ifndef xxx
	ios::sync_with_stdio(false), cin.tie(nullptr), cout.tie(nullptr);
#endif
	cout<<fixed<<setprecision(10);
	int t;
	cin>>t;
	while(t--)
	{
		ll x, y;
		cin>>x>>y;
		cout<<getAns(x, y)<<'\n';
	}
	return 0;
}