#include <bits/stdc++.h>
using namespace std;
#define fs first
#define endl '\n'
#define sc second
#define pb push_back
#define int long long
#define bit(x) (1ll << (x))
#define sz(x) (int)(x).size()
#define al(x) (x).begin(),(x).end()
#define all(x) (x).begin() + 1,(x).end()
using LL = long long;
using VI = vector <int>;
using VS = vector <string>;
using PII = pair <int, int>;
using I64 = unsigned long long;
using VVI = vector < vector<int> >;
template<LL N> using AL = array<LL, N>;
template<int N> using AI = array<int, N>;
const int inf = bit(60);

void solve() {
    int x, y;
    cin >> x >> y;
    if(x >= y) {
        cout << x - y << endl;
        return;
    }
    int idx = (int)(sqrt(2 * x) + 1.5) - 1;
    int idy = (int)(sqrt(2 * y) + 1.5) - 1;
    int posx = (idx * (idx + 1) / 2) - x + 1;
    int posy = (idy * (idy + 1) / 2) - y + 1;
    if(posx == posy) {
        cout << idy - idx << endl;
    }
    else if(posx < posy) {
        cout << posy - posx + idy - idx << endl;
    }
    else {
        int ans1 = inf;
        int d = idy + 1;
        ans1 = min(ans1, d - idx + d - posx + posy);
        ans1 = min(ans1, idy - posx + posy + idy - (idy - 1));
        cout << ans1 << endl;
    }
}

signed main() {
    ios::sync_with_stdio(false);
    cin.tie(nullptr);
    cout.tie(nullptr);
    cout << fixed << setprecision(10);
    int T = 1;
    cin >> T;
    while(T--) solve();

    return 0;
}