#include <bits/stdc++.h>
 
using namespace std;
using ll = long long;
using pii = pair<int, int>;
using pll = pair<ll, ll>;
 
mt19937 rng((int) chrono::steady_clock::now().time_since_epoch().count());
    
const int MOD = 1e9 + 7;
const int MAXN = 2e5 + 5;
const ll INF = 2e18;

ll f(ll x) { return x + floor(sqrtl(2*x) + 1.5); }

ll numSteps(ll x, ll y)
{
    ll ans = 0;
    ll t = floor(sqrtl(2*x) + 1.5);
    ll q = ceil((-2*t - 1 + sqrtl(4*t*t - 4*t + 1 + 8*y - 8*x))/2);

    // cout << "x = " << x << " t = " << t << " q = " << q << endl;
    // cout << q << endl;

    x += (2*t + q)*(q + 1)/2;
    return (q + 1) + (x - y);
}

ll query(ll x, ll y)
{
    if( x > y )
        return x - y;

    ll t = floor(sqrtl(2*x) + 1.5);
    ll st = (t - 2)*(t - 1)/2;

    // cout << st << endl;

    ll ans = numSteps( x , y );
    ans = min( ans , (x - st) + numSteps( st , y ) );

    return ans;
}

int main() 
{
    ios::sync_with_stdio(false);
    cin.tie(0);
    int t;
    cin >> t;

    while( t-- )
    {
        ll x, y;
        cin >> x >> y;

        cout << query( x , y ) << endl;
    }

    return 0;
}