#include<bits/stdc++.h>

using namespace std;
#define forn(i,p,q) for(long long i = p;i <=q;i++)
#define pii pair<int,int>
#define x first
#define y second
int dx[] = {1,-1,0,0};
int dy[] = {0,0,1,-1};
long long sum(long long x)
{
    return x * (x + 1LL) / 2LL;
}
long long binary1(long long l, long long r, long long x)
{
	while(l<r)
	{
		long long mid=(r+l)>>1;
		if(sum(mid) >= x) r=mid;//类似于线段树,check()则取r = 左的最后一个
		else l=mid+1;//否则就是l = 右的第一个
	}
	return l;//可以做类似于上面的改变，!check(),返回l+极小元
}
long long lv(long long x)
{
    return binary1(1,2000000000,x);
}
int main()
{
    long long T;
    cin >> T;
    while(T--)
    {
        long long p, q;
        cin >> p >> q;
        if(p >= q) cout << p - q << endl;
        else
        {
            long long plv = lv(p), qlv = lv(q);
            long long ans = (sum(qlv) - q) - (sum(plv) - p);
            if(ans < 0)
            {
                ans = (sum(qlv) - q) + (p - sum(plv-1)) + 1;
            }
            cout << qlv - plv + ans << endl;
        }
    }
	return 0;
}
//1000000000000000000