#include<bits/stdc++.h>

using namespace std;
typedef long long ll;
const int N=1000010;
const ll inf=0x3f3f3f3f3f3f3f3f;

ll check(__int128 x,__int128 w)
{
	__int128 l=(x*(x-1)/2);
	__int128 r=((x+1)*(x)/2);
	if(w>l&&w<=r) return 1;
	else if(w>r)
	{
		return 2;
	}
	else
	{
		return 0;
	}
}

void solve()
{
	ll n,m;
	cin>>n>>m;
	if(m<=n)
	{
		cout<<n-m<<"\n";
		return ;
	}
	else
	{
		ll l=1,r=inf;
		ll l1,l2,r1,r2;
		ll lestr=0;
		ll ned=inf;
		ll id1=0,id2=0;
		ll ans=inf;
		while(l<r)
		{
			ll mid=l+r>>1;
			if(mid==2)
			{
				ll wwww=0;
			}
			ll w=check(mid,n);
			if(w==1)
			{
				l1=(mid*(mid-1)/2)+1;
				r1=((mid+1)*(mid)/2);
				id1=mid;
				if(l1!=1)
				{
					lestr=((mid-1)*(mid)/2);
					ned=n-lestr;
				}
				break;
			}
			else if(w==0)
			{
				r=mid;
			}
			else
			{
				l=mid+1;
			}
		}
		l=1,r=inf;
		while(l<r)
		{
			ll mid=l+r>>1;
			ll w=check(mid,m);
			if(w==1)
			{
				l2=(mid*(mid-1)/2)+1;
				r2=((mid+1)*(mid)/2);
				id2=mid;
				break;
			}
			else if(w==0)
			{
				r=mid;
			}
			else
			{
				l=mid+1;
			}
		}
		ll pos=0;
		if(id2==id1)
		{
			ans=1;
			pos=n+id1+1;
			ans+=pos-m;
			pos=r2;
			ans=min(ans,ned+(id2-id1+1)+pos-m);
		}
		else
		{
			ll res=id2-id1;
			pos=n+(id1+1+id1+res)*res/2;
			if(pos>=m)
			{
				ans=min(ans,res+pos-m);
			}
			else
			{
				res++;
				pos=n+(id1+1+id1+res)*res/2;
				ans=min(ans,res+pos-m);
			}
			pos=r2;
			ans=min(ans,ned+(id2-id1+1)+pos-m);
		}
		cout<<ans<<"\n";
	}
}

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