//Think twice,code once.
#include<bits/stdc++.h>
#define endl '\n'
#define INF 0x3f3f3f3f3f3f3f
#define inf 0x3f3f3f3f
#define ff first
#define ss second
#define pii pair<int,int>
#define int long long
#define mem(i,n) memset(i,n,sizeof i)
#define dg(a) std::cout << #a << " = " << a << endl
typedef long long ll;
typedef unsigned long long ull;
using namespace std;

void solve()
{
    int x,y;
    cin >> x >> y;
    if(x>=y)
    {
        cout << x-y << endl;
        return;
    }
    auto calc=[&](int num){
        __int128_t l=1,r=1e10;
        while(l<r)
        {
            __int128_t mid=l+r>>1;
            if(mid*(mid+1)/2>=num) r=mid;
            else l=mid+1;
        }
        return l;
    };
    __int128_t one=1;
    int cnt1=calc(x);
    int cnt2=calc(y);
    int t1=one*cnt1*(cnt1+1)/2-x+1;
    int t2=one*cnt2*(cnt2+1)/2-y+1;
    if(t2>=t1)
    {
        int ans=cnt2-cnt1+t2-t1;
        cout << ans << endl;
    }
    else
    {
        int ans1=0;
        ans1+=1;
        cnt1+=1;
        ans1+=cnt1-t1+t2;
        cnt1-=1;
        ans1+=cnt2-cnt1;
        int ans2=0;
        ans2+=cnt1-t1+t2;
        cnt1-=1;
        ans2+=cnt2-cnt1;
        cout << min(ans1,ans2) << endl;
    }
}

int32_t main()
{
    std::ios_base::sync_with_stdio(false);
    std::cin.tie(nullptr);
    std::cout.tie(nullptr);
    int t = 1;
    std::cin >> t;
    while(t--) solve();
    return 0;
}