#include<bits/stdc++.h>

using namespace std;

#define fi first
#define se second
#define mp make_pair
#define pb push_back
#define pf push_front
#define LC k<<1
#define RC k<<1|1
#define IO cin.sync_with_stdio(false); cin.tie(0); cout.tie(0);
#define all(x) (x).begin(), (x).end()
#define SZ(x) ((int)(x).size())
#define rep(i, a, n) for (int i = a; i < n; i++)
#define repn(i, a, n) for (int i = a; i <= n; i++)
#define per(i, a, n) for (int i = (n) - 1; i >= a; i--)
#define pern(i, a, n) for (int i = n; i >= a; i--)

typedef long long LL;
typedef long double LD;
typedef unsigned long long ull;
typedef pair<int, int> PII;
typedef pair<int, LL> PIL;
typedef pair<LL, int> PLI;
typedef pair<double, double> PDD;
typedef pair<ull, ull> PUU;
typedef pair<LL, LL> PLL;

const int N = 110000;
const int M = 1100000;
const int mod = 1e9+7;
const int inf = (int)1e9;
const LL INF = 1e18;
const double eps = 1e-9;

mt19937_64 Rand((unsigned long long)new char);
#define rand Rand

int T;
LL a, b;
LL cal(LL x) {
	x = x * 2;
	x = (LL)(sqrt(x) + 1.5 + eps);
	return x;
}
int main() {
	IO;
	// repn(i, 1, 1000) cout << cal(i) << " " << cal(i + cal(i)) << "\n";
	cin >> T;
	while (T--) {
		cin >> a >> b;
		if (a >= b) {
			cout << a - b << "\n";
			continue;
		}
		LL x = cal(a), y = cal(b), n = x * (x - 1) / 2 - a, m = y * (y - 1) / 2 - b;
		LL ans = INF;
		if (n <= m) ans = min(y + m - n - x, y + m - n);
		else ans = y + m - n;
		cout << ans << "\n";
	}
	return 0;
}