#include<bits/stdc++.h>
#define ll long long
#define int long long
#define fr(i,j,k) for(register int i=j;i<=k;++i)
#define rf(i,j,k) for(register int i=j;i>=k;--i)
#define foredge(i,j) for(register int i=head[j];i;i=e[i].nxt)
#define pb push_back
#define Times printf("Time:%.3lf\n",clock()/CLOCKS_PER_SEC)
#define pii pair<int,int>
#define mk make_pair
using namespace std;
inline int read(){
	int x=0;
	bool f=0;
	char c=getchar();
	while(!isdigit(c)) f|=(c=='-'),c=getchar();
	while(isdigit(c)) x=(x<<3)+(x<<1)+(c^48),c=getchar();
	return f?-x:x;
}
inline void write(int x){
    if(x<0){putchar('-');x=-x;}
    if(x>9)write(x/10);
    putchar(x%10+'0');
}
inline void writeln(int x){write(x); puts("");}
inline void writepl(int x){write(x); putchar(' ');}
mt19937 rnd(chrono::steady_clock::now().time_since_epoch().count());
inline int randfind(int l,int r){return rnd()%(r-l+1)+l;}
const int V=1414213563;
inline int getans(int x){return x*(x+1)/2;}
inline pii query(int x){
    int l=0,r=V,ans=0;
    while(l<=r){
        int mid;mid=(l+r)>>1;
        if(getans(mid)<x) ans=mid,l=mid+1;
        else r=mid-1;
    }
    return mk(ans+1,getans(ans+1)-x+1);
}
inline int Add(int x){return (floor)(sqrt(2*x)+1.5);}
inline void work(){
    int n,m;
    n=read();m=read();
    if(n>m) {writeln(n-m);return;}
    int nx,ny,mx,my;
    pii now1=query(n);pii now2=query(m);
    nx=now1.first;ny=now1.second;mx=now2.first;my=now2.second;
    // cout<<nx<<' '<<ny<<' '<<mx<<' '<<my<<endl;
    if(nx<=mx && ny<=my) {writeln(mx+my-nx-ny);return;}
    // writeln(ny-my+mx-nx);
    int ans=nx-ny+1;
    --nx;ny=1;
    ans+=mx+my-nx-ny;
    writeln(ans);
    // puts("**");
}
inline void init(){
	int t=read();
	while(t--) work();
}
signed main(){
	// freopen("input.in","r",stdin);
	// freopen("output.out","w",stdout);
    init();
    // fr(i,1,100) cout<<i<<' '<<Add(i)<<endl;
    // printf("\nTIME:%.3lf",(double)clock()/CLOCKS_PER_SEC);
	return 0;
}