#include<bits/stdc++.h>
using namespace std;
using ll = long long;
const ll N = 2e5+7,mod=1e9+7,INF=1e18;
#define endl '\n'

void solve(){
	ll x,y;
	cin>>x>>y;
	if(y<=x) cout<<x-y<<endl;
	else{
		ll a1,b1,a2,b2;	
		auto cal=[&](ll x,ll &a,ll &b)->void{	
			ll l=0,r=2e9,mid;
			while(l<r){
				mid=(l+r+1)/2;
				if(mid*(mid+1)/2<x) l=mid;
				else r=mid-1;
			}
			ll num1=l*(l+1)/2,num2=x-num1;
			a=l+1-(num2-1),b=num2;	
		};
		cal(x,a1,b1);
		cal(y,a2,b2);
		if(a2>=a1){
			if(b2>=b1)
				cout<<2*(a2-a1)+abs(b2-b1)<<endl;
			else	
				cout<<2*(a2-a1)-abs(b2-b1)<<endl;
		}else{
			ll ans=b1;
			b1=a1+b1-2,a1=1;
			if(b2>=b1)
				cout<<ans+2*(a2-a1)+abs(b2-b1)<<endl;
			else	
				cout<<ans+2*(a2-a1)-abs(b2-b1)<<endl;
		}
	}
}

int main(){
	std::ios::sync_with_stdio(false);
	cin.tie(0);
	ll T=1;
    cin>>T;
    while(T--){
        solve();
    }
	return 0;
}