#include <bits/stdc++.h>
using namespace std;
#define rep(i,a,n) for (int i=a;i<n;i++)
#define per(i,a,n) for (int i=n-1;i>=a;i--)
#define pb push_back
#define eb emplace_back
#define mp make_pair
#define all(x) (x).begin(),(x).end()
#define fi first
#define se second
#define SZ(x) ((int)(x).size())
typedef vector<int> VI;
typedef basic_string<int> BI;
typedef long long ll;
typedef pair<int,int> PII;
typedef double db;
mt19937 mrand(random_device{}()); 
const ll mod=998244353;
int rnd(int x) { return mrand() % x;}
ll powmod(ll a,ll b) {ll res=1;a%=mod; assert(b>=0); for(;b;b>>=1){if(b&1)res=res*a%mod;a=a*a%mod;}return res;}
ll gcd(ll a,ll b) { return b?gcd(b,a%b):a;}
// head

/*const int N=1010;*/

pair<ll,ll> getp(ll x) {
	ll y=floor(sqrt(2*x)+1.5);
	while (y*(y-1)/2<x) y++;
	while ((y-1)*(y-2)/2>=x) --y;
	return mp(y,y*(y-1)/2-x);
}

ll x,y;
ll solve() {
	scanf("%lld%lld",&x,&y);
	if (x>=y) {
		return x-y;
	}
	auto [x1,x2]=getp(x);
	auto [y1,y2]=getp(y);
	//printf("%lld %lld %lld %lld\n",x1,x2,y1,y2);
	if (y2>=x2) return y1-x1+y2-x2;
	return x-((x1-2)*(x1-1)/2-y2)+y1-x1+1;
}

int _;
int main() {
	for (scanf("%d",&_);_;_--) {
		printf("%lld\n",solve());
	}
}