#include <bits/stdc++.h>
using namespace std;
#define int long long
#define N 200005
#define endl '\n'
int T, x, y, n, ret = 0, ans = 0, cnt = 0;
signed main() // int((2x)^(1/2)+1.5)=2,3,3,4,4,4......
{
    cin >> T;
    while (T--)
    {
        cin >> x >> y;
        // x = rand(), y = rand();
        // cout << x << " " << y << endl;
        if (x >= y)
        {
            cout << x - y << endl;
        }
        else
        {
            int tmp1 = sqrt(2 * x), tmp2 = sqrt(2 * y);
            if (2 * x > tmp1 * (tmp1 + 1))
                tmp1++;
            tmp1++;
            if (2 * y > tmp2 * (tmp2 + 1))
                tmp2++;
            tmp2++;
            cnt = 0;
            ret = 0;
            ret = x - (tmp1 - 2) * (tmp1 - 1) / 2 + (tmp2 - 1) * tmp2 / 2 - y + tmp2 - tmp1 + 1;
            if (tmp1 != tmp2)
            {
                cnt = tmp2 - tmp1;
                x += (tmp2 - 1 + tmp1) * (tmp2 - tmp1) / 2;
                tmp1 = tmp2;
            }
            if (x >= y)
                ans = x - y;
            else
                ans = min(x + tmp2 - y, x - (tmp1 - 2) * (tmp1 - 1) / 2 + (tmp1 - 1) * tmp1 / 2 - y + 1ll);
            cout << min(ret, cnt + ans) << endl;
            // cout << cnt << ' ' << ans << ' ' << ret << endl;
            // cout << tmp1 << ' ' << tmp2 << endl;
        }
    }
    return 0;
}