#include<cstring>
#include<cstdio>
#include<algorithm>
#include<iostream>
using namespace std;
typedef long long ll;
ll i,j,n,m,k,l,o,p,r,mid,gs,ans,t,x,y,wz,wz1,x1,y1,ans1;
ll min(ll a,ll b){return a<b?a:b;}
int main()
{
//	freopen("1.in","r",stdin);
	scanf("%d",&t);
	while(t--)
	{
		
	scanf("%lld%lld",&n,&m);
	if(n>=m)
	{
		printf("%lld\n",n-m);
	}
	else
	{
		ans=0;ans1=0;
		l=1;r=1e10;
		while(l<r)
		{
			mid=(l+r)/2;
			gs=(mid)*(mid+1)/2;
			if(n<=gs) r=mid;
			else l=mid+1;
		}
		x=l;
		wz=n-(1+x-1)*(x-1)/2;
		x1=x-wz;
		l=1;r=1e10;
		while(l<r)
		{
			mid=(l+r)/2;
			gs=(mid)*(mid+1)/2;
			if(m<=gs) r=mid;
			else l=mid+1;
		}
		y=l;
		wz1=m-(1+y-1)*(y-1)/2;
		y1=y-wz1;
		
		if(x1<=y1)
		{
			ans+=y-x;
			ans+=y1-x1;
		}
		else
		{
			ans+=y-x+1;
			ans+=wz+1+y1;
		}
		ans1+=wz;
		ans1+=y-x+1;
		ans1+=y1;
		printf("%lld\n",min(ans,ans1));
	}
	
	}
}