#include "bits/stdc++.h"

#define rep(i, n) for (int i = 0; i < (n); ++i)
#define rep1(i, n) for (int i = 1; i < (n); ++i)
#define rep1n(i, n) for (int i = 1; i <= (n); ++i)
#define repr(i, n) for (int i = (n) - 1; i >= 0; --i)
#define pb push_back
#define eb emplace_back
#define all(a) (a).begin(), (a).end()
#define rall(a) (a).rbegin(), (a).rend()
#define each(x, a) for (auto &x : a)
#define ar array
#define vec vector
#define range(i, n) rep(i, n)

using namespace std;

using ll = long long;
using ull = unsigned long long;
using ld = long double;
using str = string;
using pi = pair<int, int>;
using pl = pair<ll, ll>;

using vi = vector<int>;
using vl = vector<ll>;
using vpi = vector<pair<int, int>>;
using vvi = vector<vi>;

int Bit(int mask, int b) { return (mask >> b) & 1; }

template<class T>
bool ckmin(T &a, const T &b) {
    if (b < a) {
        a = b;
        return true;
    }
    return false;
}

template<class T>
bool ckmax(T &a, const T &b) {
    if (b > a) {
        a = b;
        return true;
    }
    return false;
}

const int INFi = 2e9;
const ll INF = 1e18;
const int LG = 18;

ll y;

// val * t + t * (t - 1) / 2 >= y - x
// 1/2 * t^2 + (val - 1/2) * t - (y - x) >= 0
// D = (val - 1/2)^2 + 2 * (y - x)
// t = (1/2 - val) + sqrt(D)

ll Add(ll x) {
    ll sx = sqrtl(2ll * x);
    while (sx * sx < 2 * x) sx++;
    while (sx * sx > 2 * x) sx--;
    if (sx * sx == 2 * x) return x + (sx + 1);
    if ((2 * sx + 1) * (2 * sx + 1) <= 8 * x) {
        return x + sx + 2;
    } else {
        return x + sx + 1;
    }
}

ll Go(ll x, ll cnt, ll val = -1) {
    if (val == -1) val = Add(x) - x;
    return x + val * cnt + cnt * (cnt - 1) / 2;
}

ll calc(ll x, ll val = -228, ll t = -228) {
    if (x >= y) return x - y;
    if (val == -228) val = Add(x) - x;
    if (t == -228) {
        t = (ld) ((ld) 0.5 - val) + sqrtl((val - (ld) 0.5) * (val - (ld) 0.5) + (ld) 2 * (y - x));
        while (Go(x, t, val) > y) t--;
        while (Go(x, t, val) < y) t++;
    }
//    cout << x << ' ' << val << ' ' << t << '\n';
    ll nu = 0;
    for(ll R = (1ll << 62ll); R >= 1; R /= 2) {
        if (R >= x) continue;
        ll x2 = x - R;
        ll val2 = Add(x2) - x2;
        if (Go(x2, t, val2) >= y) {
            x = x2;
            val = val2;
            nu += R;
        }
    }
//    cout << nu << '\n';
    assert(nu >= 0);
    ll g = Go(x, t, val);
    if (g == y) return t + nu;
    assert(g >= y);
    ll needt = g - y;
    if (needt <= 1) return nu + t + needt;
    if (needt < t) return nu + calc(Go(x, t - needt), val + (t - needt), needt) + (t - needt);
    return nu + calc(x + val, val + 1, t - 1) + 1;
}

void solve() {
    ll x; cin >> x;
    cin >> y;
    cout << calc(x) << '\n';
}

signed main() {
    ios_base::sync_with_stdio(false);
    cin.tie(0);
    cout << setprecision(12) << fixed;
    int t = 1;
    cin >> t;
    rep(i, t) {
        solve();
    }
    return 0;
}