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

#define all(x) begin(x), end(x)
#ifdef CKISEKI
#define safe cerr << __PRETTY_FUNCTION__ << " line " << __LINE__ << " safe\n"
#define debug(a...) debug_(#a, a)
#define orange(a...) orange_(#a, a)
template <typename ...T>
void debug_(const char *s, T ...a) {
    cerr << "\e[1;32m(" << s << ") = (";
    int cnt = sizeof...(T);
    (..., (cerr << a << (--cnt ? ", " : ")\e[0m\n")));
}
template <typename I>
void orange_(const char *s, I L, I R) {
    cerr << "\e[1;32m[ " << s << " ] = [";
    while (L != R) cerr << " " << *L++;
    cerr << " ]\e[0m\n";
}
#else
#define safe ((void)0)
#define debug(...) safe
#define orange(...) safe
#endif


pair<int64_t,int64_t> getCoord(int64_t z) {
    int64_t X = 0;
    for (int s = 1<<30; s; s >>= 1) {
        if ((X + s) * (X + s + 1) / 2 <= z) {
            X += s;
        }
    }
    return {X, z - X * (X + 1) / 2};
}

void solve() {
    int64_t x, y;
    cin >> x >> y;
    if (x > y) {
        cout << x - y << '\n';
        return;
    }

    auto [sx, sy] = getCoord(x - 1);
    auto [tx, ty] = getCoord(y - 1);
    int64_t ans = 1e18;

    debug(sx, sy);
    debug(tx, ty);
    assert (sx <= tx);
    if (tx - ty >= sx - sy) {
        ans = min(ans, tx - sx + ((tx - ty) - (sx - sy)));
    }
    {
        ans = min(ans, tx - sx + 1 + (tx - ty) + (sy + 1));
    }

    cout << ans << '\n';
}

int main() {
    cin.tie(nullptr)->sync_with_stdio(false);

    for (int x = 0; x <= 20; x++) {
        auto [X, Y] = getCoord(x);
        debug(X, Y, x + 1);
    }

    // int last = -1;
    // for (int i = 1; i <= 200; i++) {
    //     int z = floor(sqrt(i * 2) + 1.5);
    //     if (z != last)
    //         cout << '\n';
    //     cout << i << ' ';
    //     last = z;
    // }

    int T;
    cin >> T;
    while (T--)
        solve();

    return 0;
}