#include <bits/stdc++.h>

using i64 = long long;

i64 go(i64 x) {
    return floor(sqrtl(x * 2) + 1.5);
}

i64 find(i64 x, i64 y) {
    i64 lo = 1, hi = 10000000000;
    while (lo < hi) {
        i64 mid = (lo + hi) / 2;
        i64 k = go(x);
        if ((__int128)(k + k + mid - 1) * mid / 2 >= y - x) {
            hi = mid;
        } else {
            lo = mid + 1;
        }
    }

    return lo;
}

void solve() {
    i64 x, y; std::cin >> x >> y;
    if (x >= y) {
        std::cout << x - y << "\n";
        return;
    }

    i64 B = find(x, y);
    i64 lo = 1, hi = x;
    while (lo < hi) {
        i64 mid = (lo + hi) / 2;
        i64 k = go(mid);
        if (mid + (__int128)(k + k + B - 1) * B / 2 >= y) {
            hi = mid;
        } else {
            lo = mid + 1;
        }
    }

    i64 k = go(lo);
    i64 ans = x - lo + B + lo + (__int128)(k + k + B - 1) * B / 2 - y;
    std::cout << ans << "\n";
}

int main() {
    std::ios::sync_with_stdio(false);
    std::cin.tie(nullptr);

    int T; std::cin >> T;
    while (T--) {
        solve();
    }
    return 0;
}