#include <bits/stdc++.h>
#define ll long long
using namespace std;
//__int128_t f(ll x)
//{
//    return floor(sqrtl(2*x)+1.5);
//}
//__int128_t a(ll x,__int128_t n)
//{
//    if(n==1)
//    {
//        return x;
//    }
//    else
//    {
//        return x+(n-1)*f(x)+n*(n-1)/2;
//    }
//}
//ll get(ll x,ll y) {
//    if(y <= x)return x - y;
//    ll l = 1, r = 1e18;
//    while(l < r) {
//        auto mid = l + r >> 1;
//        if(a(x,mid) < y)l = mid + 1;
//        else r = mid;
////        cout<<l<<" "<<r<<" "<<mid<<" "<<(ll)a(x,mid)<<endl;
//    }
//    return l;
//}

int64_t get(int64_t x) {
    int64_t l = 0, r = 2e9;
    int64_t ret{};
    while(l < r) {
        auto mid = l + r >> 1;
        if(mid * (mid + 1) < x * 2)ret = mid, l = mid + 1;
        else r = mid;
    }return ret;
}


int main()
{
    ll x,y;cin>>x;
    int i = x,k{};
    if(i > 50)i = 0,k++;
    while(cin>>x>>y){
        if(y <= x)cout<< x - y << "\n";
        else {
            ll d1 = get(x), d2 = get(y);
            ll ax = d1 * (d1 + 1) / 2, ay = d2 * (d2 + 1) / 2;
            ll now_x = x - ax, now_y = y - ay;
            ll jmp = d2 - d1;
            ll ny = max<ll>(1,now_y - jmp);
            if(ny <= now_x) {
                ll as = jmp + now_x - ny;
                if(now_y - jmp < 1) {
                    as += (jmp - now_y + 1);
                }
                cout << as << '\n';

            }else {
                ++jmp;
                --ny;
                jmp += d1 - ny + now_x;
                cout << jmp << '\n';
            }
        }
    }

}
//45 45415