#include<bits/stdc++.h>
#define Gc() getchar() 
#define Me(x,y) memset(x,y,sizeof(x))
#define Mc(x,y) memcpy(x,y,sizeof(x))
#define d(x,y) ((m)*(x-1)+(y))
#define R(n) (rnd()%(n)+1)
#define Pc(x) putchar(x)
#define LB lower_bound
#define UB upper_bound
#define fi first
#define se second
using namespace std;using ll=long long;using db=double;using lb=long db;using ui=unsigned;using ull=unsigned long long;using pii=pair<int,int>;using LL=__int128;
const int N=1e3+5,M=2e3+5,K=63,mod=998244353,Mod=mod-1;const db eps=1e-9;const ll INF=1e18+7;mt19937 rnd(time(0));
ll x,y;
ll opt(ll x){return sqrtl(2*x)+1.5;}
ll reduce(ll x){
	ll g=opt(x);
	ll l=0,r=x,mid;while(l+1<r) mid=l+r>>1,(opt(mid)^g?l:r)=mid;
	return l;
}
ll calc(ll x,ll y){
	ll l=-1,r=2e9+7,mid,d=opt(x);
	while(l+1<r) mid=l+r>>1,(x+(d+d+mid-1)*mid/2>=y?r:l)=mid;
	// cerr<<x+(d+d+r-1)*r/2<<'\n';
	return r+x+(d+d+r-1)*r/2-y;
}
void Solve(){
	int i,j;scanf("%lld%lld",&x,&y);
	ll ans=calc(x,y);
	ll z=reduce(x);
	ans=min(ans,calc(z,y)+x-z);
	printf("%lld\n",ans);
}
int main(){
	int t;scanf("%d",&t);while(t--) Solve();
}