#include <bits/stdc++.h>
using namespace std;
#define int long long
const int N = 1e7 + 5;
const int mod = 998244353;
#define endl '\n'
typedef long long ll;

bool check(int m,int x)
{
    return (__int128)m * (m + 1) / 2 >= x;
}

int findblk(int x)
{
    int l = 1,r = 1e18;
    while(l < r)
    {
        int mid = l + r  >> 1;
        if(check(mid, x))r = mid;
        else l = mid + 1;
    }
    return l;
}
int blk(int x)
{
    return x * (x + 1) / 2;
}

int findlast(int x)
{
    int pos = findblk(x);
    return blk(pos) - x + 1;
}
// 1000000000000000000
void solve() 
{
    
    int a,b;cin >> a >> b;
    if(a >= b)
    {
        cout << a - b << endl;
    }
    else 
    {
        int pa = findlast(a), pb = findlast(b);
        int ida = findblk(a), idb = findblk(b);
        int res = idb - ida;
        
        if(pb >= pa)res += pb - pa;
        else res += pb + idb + 1 - pa + 1;
        int tmp = 0;
        tmp += max(pb + 1, ida + 1) - pa;
        tmp += pb - 1;
        tmp += idb - ida + 1;
        res = min(res, tmp);
        cout << res << endl;
    }
}

signed main()
{
    ios::sync_with_stdio(false);cin.tie(0);
    int cnt = 2;
    int T;cin >> T;
    while(T--)
    solve();
}