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

typedef long long LL;

LL x, y, ans;

LL gap(LL x) {
    return 1LL*floor(sqrt(x*2)+1.5);
}
// x = 8, y = 14
void solve() {
    cin >> x >> y;
    if(x >= y) {
        cout << x-y << '\n';
        return;
    }
    LL gx = gap(x)-1, gy = gap(y)-1;
    LL beginx = gx*(gx-1)/2 + 1, beginy = gy*(gy-1)/2 + 1;
    LL px = gx - (x - beginx), py = gy - (y - beginy);
    LL ans = gy - gx;
    // cerr << ans << ' ' << px << ' ' << py << '\n';
    if(px > py) ans += py + x - beginx + 1;
    else ans += py - px;
    cout << ans << '\n';
}
void tsolve() {
    LL x = 1, xx = x;
    for(int i = 1; i <= 100; i ++) {
        LL g = gap(i)-1, begin = g*(g-1)/2 + 1;
        cout << setw(3) << i << " : " << setw(3) << g << ' ' << setw(3) <<
          begin << ' ' << setw(3) << g - (i - begin) << '\n';
    }
}
int main() {
    ios::sync_with_stdio(0); cin.tie(0);
    int T = 1;  cin >> T;
    while(T--) {
        solve();
        // tsolve();
    }
    return 0;
}