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

using pii = pair<int, int>;
#define ft first
#define sd second

pii find(int x) {
    auto calc = [&](int x) -> int{ return (1+x)*x/2;};
    int L=1, R=2e9+5;
    while (L<R) {
        int M=L+(R-L)/2;
        if (calc(M)>=x) R=M;
        else L=M+1;
    }
    return {L, calc(L)};
}

int solve() {
    int x, y; cin >> x >> y;
    if (x>y) return x-y;

    auto [v1, res1] = find(x);
    auto [v2, res2] = find(y);
    int pos = res2 - (res1-x);
    if (pos < y) {
        int ans = 0;
        res1 -= v1;
        --v1;
        return x-(res1-(res2-y)) + v2-v1;
    } else return v2 - v1 + pos - y;
}

signed main() {
    ios::sync_with_stdio(0); cin.tie(0);
    int t; cin >> t; while (t--) cout << solve() << '\n';
    return 0;
}