#include <bits/stdc++.h>
using namespace std;


#define F(i, a, b) for (int i = (a), iee = (b); i <= iee; i++)
#define R(i, a, b) for (int i = (a), iee = (b); i >= iee; i--)

using ll = long long;

const int N = 100100;
int n, a[N];
ll b[N], x[N];

ll exgcd(ll a, ll b, ll &x, ll &y) {
    if (!b) {
        x = 1, y = 0;
        return a;
    }
    ll g = exgcd(b, a % b, y, x);
    y -= a / b * x;
    return g;
}

int gt(ll x) {
    ll l = 1, r = 2e9;
    while (l < r - 1) {
        ll t = (l + r) >> 1;
        if (t * (t - 3) / 2 + 2 <= x)
            l = t;
        else
            r = t;
    }
    //assert(l == floor(sqrt(x * 2) + 1.5));
    return l;
}
pair<ll, ll> get(ll t) {
    return {t * (t - 3) / 2 + 2, t * (t - 1) / 2};
}

ll calc(ll x, ll y) {
    ll tx = gt(x), ty = gt(y);
    auto gy = get(ty), gx = get(tx);
    x += gy.second - gx.second;
    ll ans = ty - tx + x - y;
    if (x < y)
        ans += gy.second - gy.first + 2;
    return ans;
}

int main() {
    cin.tie(0)->sync_with_stdio(0), cout.tie(0);
    //F(i, 1, 20) cout << get(gt(i)).first << " "; cout << endl;
    int T;
    for (cin >> T; T; T--) {
        ll x, y;
        cin >> x >> y;
        if (x >= y) { cout << x - y << "\n"; continue; }
        auto gx = get(gt(x));
        ll ans = calc(x, y);
        if (x > 1) ans = min(ans, x - gx.first + 1 + calc(gx.first - 1, y));
        cout << ans << "\n";
    }
}

// y-1/2-sqrt(2y-2)<=x<y+1/2-sqrt(2y)