#include<bits/stdc++.h>
using namespace std;
#define fi first
#define se second
#define endl '\n'
using ll = long long;
using ull = unsigned long long;
using PII = pair<int, int>;
using PLL = pair<ll, ll>;
const int N = 1e6 + 10;
const int M = 131;
const int INF = 0x3f3f3f3f;
const long long LNF = 0x3f3f3f3f3f3f3f3f;
const long long mod = 1e9 + 7;

ll cal(ll x){
    ll res = sqrt(2ll * x);
    while(res * (res + 1) < 2ll * x) res++;
    while(res * (res - 1) > 2ll * x) res--;
    return res;
}

void solve(){
    ll x, y; cin >> x >> y;
    if(x >= y){
        cout << x - y << '\n'; return ;
    }
    ll a = cal(x), b = x - a * (a - 1) / 2 - 1;
    ll c = cal(y), d = y - c * (c - 1) / 2 - 1;
    //cout << a << ' ' << b << ' ' << c << ' ' << d << '\n';
    ll num1 = a - b, num2 = c - d;
    //cout << num1 << ' ' << num2 << '\n';
    if(num1 <= num2){
        cout << c - a + num2 - num1 << '\n';
    }
    else{
        cout << c - a + 1 + b + c - d << '\n';
    }
}

int main(){
    ios::sync_with_stdio(false);
    cin.tie(nullptr);
    cout << fixed << setprecision(12);
    int t = 1;
    cin >> t;
    while(t--){
        solve();
    }
    return 0 - 0;
}