#include<bits/stdc++.h>
#define int long long
#define ull unsigned long long
#define maxn
#define put() putchar('\n')
#define Tp template<typename Ty>
#define Ts template<typename Ty,typename... Ar>
using namespace std;
inline void read(int &x){
    int f=1;x=0;char c=getchar();
    while (c<'0'||c>'9') {if (c=='-') f=-1;c=getchar();}
    while (c>='0'&&c<='9') {x=x*10+c-'0';c=getchar();}
    x*=f;
}
namespace Debug{
	Tp void _debug(char* f,Ty t){cerr<<f<<'='<<t<<endl;}
	Ts void _debug(char* f,Ty x,Ar... y){while(*f!=',') cerr<<*f++;cerr<<'='<<x<<",";_debug(f+1,y...);}
	Tp ostream& operator<<(ostream& os,vector<Ty>& V){os<<"[";for(auto& vv:V) os<<vv<<",";os<<"]";return os;}
	#define gdb(...) _debug((char*)#__VA_ARGS__,__VA_ARGS__)
}using namespace Debug;
#define fi first
#define se second
#define mk make_pair
const int mod=1e9+7;
inline int power(int x,int y=mod-2) {
	int sum=1;
	while (y) {
		if (y&1) sum=sum*x%mod;
		x=x*x%mod;y>>=1;
	}
	return sum;
}
inline int W(int x) {return (int)floor(sqrt(2*x)+1.5);}
inline void solve(void) {
	int x,y;
	read(x),read(y);
	int l=0,r=x+1,mid;
	while (l+1<r) {
		int mid=l+r>>1;
		if (W(mid)==W(x)) r=mid;
		else l=mid;
	}
	int id=r-1,v=x-id+1;id=id+W(id);
	if (x>=y) return printf("%lld\n",x-y),void(); 
	if (x==1) {
		l=0,r=2e9;
		while (l+1<r) {
			mid=l+r>>1;
			if (y<=(mid)*(mid+1)/2) r=mid;
			else l=mid;
		}
		int tmp=r*(r+1)/2;
		printf("%lld\n",r-1+tmp-y);
		return ;
	}
	int tmp=id-x+v;
	l=-1,r=2e9;
	while (l+1<r) {
		mid=l+r>>1;
		if (y<=x+(mid)*(tmp+tmp+mid-1)/2+id-x) r=mid;
		else l=mid;
	}
	int pus=x+(r)*(tmp+tmp+r-1)/2;
//	gdb(x,pus);
	if (y<=pus) printf("%lld\n",pus-y+r);
	else printf("%lld\n",r+(pus+id-x)-y+v);
}
signed main(void){
	int T;
	read(T);
	while (T--) solve();
	return 0;
}