#include <bits/stdc++.h>
#define ll long long
#define int ll
#define mp make_pair
#define fi first
#define se second
#define pb push_back
#define vi vector<int>
#define pi pair<int, int>
#define vpii vector<pi>
#define il inline
#define ri register
#define all(a) a.begin(), a.end()
#define fr(a) freopen(a, "r", stdin)
#define fo(a) freopen(a, "w", stdout);
#define mod 998244353
#define debug puts("------------------------")
#define lowbit(x) (x&-x)
#define ls(x) x << 1
#define rs(x) x << 1 | 1
template<typename T> bool chkmin(T &a, T b){return (b < a) ? a = b, 1 : 0;}
template<typename T> bool chkmax(T &a, T b){return (b > a) ? a = b, 1 : 0;}
ll ksm(ll a, ll b) {if (b == 0) return 1; ll ns = ksm(a, b >> 1); ns = ns * ns % mod; if (b & 1) ns = ns * a % mod; return ns;}
void Read(int &a) {a=0;int c=getchar(),b=1; while(c>'9'||c<'0') {if(c=='-')b=-1;c=getchar();} while(c>='0'&&c<='9') a=(a<<3)+(a<<1)+c-48,c=getchar();a*=b; }
int  read() {int a=0,c=getchar(),b=1; while(c>'9'||c<'0') {if(c=='-')b=-1;c=getchar();} while(c>='0'&&c<='9') a=(a<<3)+(a<<1)+c-48,c=getchar();return a*=b; }
void write(int x) {if(x>9)write(x/10);putchar('0'+x%10);}
void W(int x) {if(x<0){putchar('-'),x=-x;}write(x);}
#define LOCAL
using namespace std;
const int maxn = 200005;
/**/

/**/
pi find(int x)
{
	int ret = (int)(sqrt(2.0 * x) + 1.5) - 1;
    return {ret, x - ret * (ret - 1) / 2};
}
// int work1(pi x, pi y)
// {
	// int ret = y.fi - x.fi;
	// x = {x.fi + ret, x.se + ret};
	// if(x.se >= y.se) return ret + x.se - y.se;
	// return LONG_LONG_MAX;
// }
// int work2(pi x, pi y)
// {
	// int ret = x.se;
	// x = {x.fi - 1, x.fi};
    // return ret + work1(x, y);
// }
int work1(pi k1,pi k2)
{
    int ans=k2.first-k1.first;
    k1.first+=ans; k1.second+=ans;
    if(k1.second<k2.second) return (int)1e18;
    return ans+k1.second-k2.second;
}
int work2(pi k1,pi k2)
{
    int ans=k1.second;
    k1.first--; 
    k1.second=k1.first;
    return ans+work1(k1,k2);
}
signed main()
{
	int T = read();
	while(T--)
	{
		int x = read(), y = read();
		if(x >= y)
		{
			cout << x - y << "\n";
			continue;
		}
		pi pos1 = find(x), pos2 = find(y);
		cout << min(work1(pos1, pos2), work2(pos1, pos2)) << "\n";
	}
	return 0;
}