#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef long double ld;
typedef pair<int, int> p11;
typedef pair<string, int> ps1;
typedef pair<ll, ll> p1111;
#define vv vector
#define pb emplace_back
#define IOS ios::sync_with_stdio(false); cin.tie(0); cout.tie(0)
#define fi first
#define se second
#define endl '\n'
#define Endl '\n'
#define all(x) (x).begin(), (x).end()
#define rall(x) (x).rbegin(), (x).rend()
#define per(a, b, c) for(int a = (b); a <= (c); a ++)
#define rep(a, b, c) for(int a = (b); a >= (c); a --)
#define aper(A) for(auto i : A) cout << i << ' ';cout << '\n'
#define lowbit(x) ((x) & (-x))
#define yes cout << "Yes" << endl
#define no cout << "No" << endl
#define YES cout << "YES" << endl
#define NO cout << "NO" << endl
#define PAI acos(-1)
#define int long long
using ll = long long;
void umin(int &x,int y){if(x>y)x=y;}
void umax(int &x,int y){if(x<y)x=y;}

void pre_work()
{
    
}

int up(int n)
{
    int l = 1, r = 2e9;
    while(l < r)
    {
        int mid = l + r >> 1;
        if(mid * (mid + 1) / 2 >= n) r = mid;
        else l = mid + 1;
    }
    return l;
}

int pos(int n, int m)
{
    return n - (m - 1) * m / 2;
}

int sum(int n)
{
    return n * (n + 1) / 2 - (n - 1) * n / 2;
}

void solve()
{
    int n, m;
    cin >> n >> m;
    int now = sqrt(2 * n) + 1.5;
    if (n >= m)
    {
        cout << n - m << endl;
    }
    else
    {   
        int n1 = up(n), m1 = up(m);
        int ans = m1 - n1;
        int npos = sum(n1) - pos(n, n1) + 1;
        int mpos = sum(m1) - pos(m, m1) + 1;
        if(npos <= mpos)
            ans += mpos - npos;
        else
        {
            ans ++;
            int suml = sum(n1 + 1);
            int lnpos = suml - npos + 1;
            ans += mpos + lnpos - 1;
            int res = m1 - n1;
            res += n - n1 * (n1 - 1) / 2;
            res += mpos;
            ans = min(ans, res);
        }
        cout << ans << endl;
    }
}

signed main()
{
  	IOS;
	int tt = 1;
	cin >> tt;
	pre_work();
	while(tt --)
	{
		solve();
	}
	return 0;
}