#include<bits/stdc++.h>
using namespace std;
using ll=long long;
template<typename T>
ostream& operator << (ostream &out,const vector<T>&x){
	if(x.empty())return out<<"[]";
	out<<'['<<x[0];
	for(int len=x.size(),i=1;i<len;i++)out<<','<<x[i];
	return out<<']';
}
template<typename T>
vector<T> ary(const T *a,int l,int r){
	return vector<T>{a+l,a+1+r};
}
template<typename T>
void debug(T x){
	cerr<<x<<'\n';
}
template<typename T,typename ...S>
void debug(T x,S ...y){
	cerr<<x<<' ',debug(y...);
}
int T;
ll x,y;
ll ed(int x){
	return x*(x-1ll)/2;
}
ll st(int x){
	return ed(x-1)+1;
}
ll find(ll x){
	ll y=sqrtl(x*2);
	for(;y>1&&st(y)>x;y--);
	for(;ed(y)<x;y++);
	// debug("find",x,y);
	return y;
}
int main(){
	for(scanf("%d",&T);T--;){
		scanf("%lld%lld",&x,&y);
		if(x>=y)printf("%lld\n",x-y);
		else{
			ll a=find(x),b=ed(a)-x;
			ll c=find(y),d=ed(c)-y;
			if(b<=d)printf("%lld\n",c-a+d-b);
			else{
				// debug(a,b,c,d,ed(a-1));
				printf("%lld\n",x-ed(a-1)+d+c-a+1);
			}
		}
	}
	return 0;
}