#include <bits/stdc++.h>

#define int long long
using i64 = long long;
const i64 INF = 1e12;
using PII = std::pair<int, int>;

void solve () {
	
	auto find = [](i64 x) {
		int ret = (int)(sqrt(2.0 * x) + 1.5) - 1;
    	return PII{ret, x - ret * (ret - 1) / 2};
	};
	std::function <i64(PII, PII)> work1 = [](PII x, PII y) {
		i64 ret = y.first - x.first;
		x = {x.first + ret, x.second + ret};
		if(x.second >= y.second) return ret + x.second - y.second;
		return INF;
	};
	auto work2 = [&](PII x, PII y) {
		int ret = x.second;
		x = {x.first - 1, x.first - 1};
	    return ret + work1(x, y);
	};
	
	i64 x, y;
	std::cin >> x >> y;
	
	if (x > y) {
		std::cout << x - y << '\n';
	}
	else {
		i64 ans = 0;
		auto pos1 = find(x), pos2 = find(y);
		std::cout << std::min(work1(pos1, pos2), work2(pos1, pos2)) << "\n";
	}
}

signed main() {
	int T;
	std::cin >> T;
	while (T--) {
		solve ();
	}
	return 0;
}