#include<bits/stdc++.h>
using namespace std;
#define int long long
inline int Sqr(int x) {
    return x * x;
}
inline int GetDelta(int x) {
    if (x == 0) return 1;
    if (x == 1) return 2;
    if (x == 2) return 3;
    int ans = sqrtl((long double)2 * x) + 1.5;
    // while (Sqr(2 * ans - 3) > 8 * x) --ans;
    ans -= 3;
    while (Sqr(2 * ans - 1) <= 8 * x) ++ans;
    return ans;
}
inline int Jump(int x, int k) {
    int delta = GetDelta(x);
    return x + (delta + delta + k - 1) * k / 2;
}
inline void Solve(int x, int y) {
    if (x >= y) { printf("%lld\n", x - y); return; }
    int delta = GetDelta(x);
    int k = -1;
    for (int l = 1, r = 1e10; l <= r; ) {
        int mid = (l + r) >> 1;
        if (x + (__int128)(delta + delta + mid - 1) * mid / 2 >= y) k = mid, r = mid - 1;
        else l = mid + 1;
    }
    int nx = Jump(x, k);
    if (GetDelta(nx) == GetDelta(y)) {
        printf("%lld\n", k + nx - y);
    } else {
        printf("%lld\n", GetDelta(x) - 1 - (y - Jump(x, k - 1)) + k);
    }
}
signed main() {
    // for (int i = 0; i <= 10000000; ++i) {
    //     int j = Jump(i, 1), k = Jump(j, 1);
    //     assert(j - i + 1 == k - j);
    // }
    // puts("ok");

    // int ans = 999999998585786438;
    // cout << Jump(ans, 1) << endl;
    // cout << GetDelta(5) << endl;
    // for (int i = 0; i <= 20; ++i) {
    //     cout << GetDelta(i) << ' ' << sqrt(2 * i) + 1.5 << endl;
    // }
    int Case;
    scanf("%lld", &Case);
    while (Case--) {
        int x, y;
        scanf("%lld%lld", &x, &y);
        Solve(x, y);
    }
    return 0;
}