#include <map>
#include <set>
#include <array>
#include <cmath>
#include <deque>
#include <bitset>
#include <random>
#include <string>
#include <vector>
#include <cassert>
#include <complex>
#include <iomanip>
#include <iostream>
#include <algorithm>
#include <unordered_map>
#include <unordered_set>

using namespace std;

#define int int64_t

int lb(int y) {
	int res = sqrtl(2 * y);
	while (res * (res + 1) / 2 < y) ++res;
	while ((res - 1) * res / 2 >= y) --res;
	return res; 
}

int lss(int y) {
	return lb(y + 1) - 1;
}

void solve() {
	int x, y;
	cin >> x >> y;
	if (x > y) {
		cout << x - y << "\n";
		return;
	}
	int k = lb(y);
	int t = k * (k + 1) / 2 - y;
	int p = lss(x - 1);
	if (t >= p) {
		int d = k - t;
		cout << d - 1 + 2 * (t - p) + x - p * (p + 1) / 2 - 1 << "\n";
	} else {
		int q = lss(t + x);
		cout << x + t - q * (q + 1) / 2 + k - q << "\n";
	}
}

main() {
	ios::sync_with_stdio(false);
	cin.tie(0);
	cout.tie(0);

	int tst;
	cin >> tst;
	while (tst--) {
		solve();
	}
	
	return 0;
}