//I wrote this code 4 u today
#include <bits/stdc++.h>

template<class t> using vc = std::vector<t>;

#define nd node*
#define pnd pair<nd, nd>

using namespace std;
typedef long long ll;
typedef vector<ll> vll;
typedef pair<ll, ll> pll;
typedef vc<pll> vpll;
typedef vc<vll> vvll;
typedef vc<vpll> vvpll;

template<const ll MOD>
struct mod_mul : std::multiplies<const ll> {
    ll operator()(const ll a, const ll b) {
        return (a * b) % MOD;
    }
};


template<typename T>
inline void sort(T &a) {
    sort(a.begin(), a.end());
}

template<typename T>
inline void unique(T &a) {
    a.resize(unique(a.begin(), a.end()) - a.begin());
}

template<typename T>
inline void reverse(T &a) {
    reverse(a.begin(), a.end());
}

const ll INF = 9023372036854775808ll;
const ll MOD = 1000000007ll;

ll find(ll x) {
    ll now = 0;
    for (ll i = 30; i >= 0; --i) {
        ll xd = (1ll << i) + now;
        if (xd * (xd + 1) / 2 < x) now += 1ll << i;
    }
    return now + 1;
}

int main() {
    cin.tie(nullptr)->ios_base::sync_with_stdio(false);
    ll t;
    cin >> t;
    while (t--) {
        ll x, y;
        cin >> x >> y;
        if (x >= y) {
            cout << x - y << '\n';
            continue;
        }
        ll n1 = find(x), d1 = n1 * (n1 + 1) / 2 - x;
        ll n2 = find(y), d2 = n2 * (n2 + 1) / 2 - y;
        ll ans = 1e18;
        if (d1 <= d2) {
            cout << n2 - n1 + d2 - d1 << '\n';
        } else {
            cout << n2 - n1 + x + 1 - (n1 - 1) * n1 / 2 + d2 << '\n';
        }
    }
}