#include<bits/stdc++.h>
#define int long long 
#define endl "\n"
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
const int N = 1e7 + 10, inf = 0x3f3f3f3f;
const long long INF = 0x3f3f3f3f3f3f3f3f; 

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

int pos(int x, int lev) {
	return x - (lev - 1) * (lev) / 2;
}

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

void solve() {
	
	int a, b;
	cin >> a >> b;
	if(b < a) {
		cout << a - b << endl;
		return ;
	} else {
		int leva = level(a), levb = level(b);
		int ans = levb - leva;
		int rposa = sum(leva) - pos(a, leva) + 1;
		int rposb = sum(levb) - pos(b, levb) + 1;
		
		if(rposa <= rposb) {
			ans += rposb - rposa;
		} else {
			ans ++ ;
			int sumLast = sum(leva + 1);
			int lastPosa = sumLast - rposa + 1;
			ans += rposb + lastPosa - 1; 
			
			int res = levb - leva;
			res += a - leva * (leva - 1) / 2;
			res += rposb;
			ans = min(ans, res);
		}
		cout << ans << endl;
	}
}
signed main() {
	ios::sync_with_stdio(0);
	cin.tie(0);
	cout.tie(0);
	int t = 1;
	cin >> t;
	for(int i = 1; i <= t; i ++ ) {
		solve();
	}
}