#include<bits/stdc++.h>
using namespace std;
#define pii pair<int,int>
#define mp make_pair
#define ll long long
#define IOS ios::sync_with_stdio(false);cin.tie(0);cout.tie(0);
const ll nn=3e5+5;
ll t,x,y;
pii find(ll x){
	ll p=(ll)(sqrt(2.0*x)+1.5)-1;//对应的+后面的数-1
	ll rst=x-p*(p-1)/2;//第rst个
	return mp(p,rst);
}
ll f1(pii x,pii y){//情况1
	ll z=y.first-x.first;
	x={x.first+z,x.second+z};//x做z次加法运算
	if(x.second>=y.second) return z+x.second-y.second;
	return 1e18;
}
ll f2(pii x,pii y){//情况2s
	ll z=x.second;
	x={x.first-1,x.first-1};//先减到前一个p的最后一个数字，再运算
	return z+f1(x,y);
}
int main(){
	IOS;
	cin>>t;
	while(t--){
		cin>>x>>y;
		if(x>=y) cout<<x-y<<endl;
		else{
			pii x1=find(x),x2=find(y);
			cout<<min(f1(x1,x2),f2(x1,x2))<<endl;
		}
	}
	return 0;
}