#include <bits/stdc++.h>
//#define double long double
#define int long long
#define eps 1e-8
#define endl "\n"
using ll=long long;
const int N=1e6+5;
const int inf=1e18;
const int mod=998244353;
using namespace std;
typedef pair<int,int>P;

void solve(){
    /*for(int i=0;i<=100;i++){
        int x=(sqrt(2*i)+1.5);
        cout<<x<<' ';
    }*/
    int a,b;cin>>a>>b;
    if(b<=a){
        cout<<a-b<<endl;
        return;
    }
    auto cal=[&](int x,int y){
        if(y<=x) return x-y;
        int rx=0,ry=0;
        int l=1,r=2e9;
        while(l<=r){
            int m=l+r>>1;
            if(m*(m+1)/2<y) l=m+1;
            else r=m-1,ry=m;
        }
        l=1,r=2e9;
        while(l<=r){
            int m=l+r>>1;
            if(m*(m+1)/2<x) l=m+1;
            else r=m-1,rx=m;
        }
        int dx=rx*(rx+1)/2-x+1,dy=ry*(ry+1)/2-y+1;
        int ans=inf;
        if(dx<=dy) ans=min(ans,ry-rx+dy-dx);
        else ans=min(ans,1+ry-dx+dy);
        return ans;
    };
    cout<<cal(a,b)<<endl;

    return;
}



signed main(){
    ios::sync_with_stdio(false);
    cin.tie(0),cout.tie(0);
    int t=1;cin>>t;
    while(t--) solve();
    return 0;
}