#include <bits/stdc++.h>
using namespace std;
#define pii pair<int, int>
#define int long long
#define inf 1e18
#define rep(i, l, n) for (int  i = l; i <= n; i++)
#define per(i, l, n) for (int  i = n; i >= l; i--)
//cout<<fixed<<setprecision(15)
const int mol=998244353;
const int N = 3e5+10,M=5010;
int qmi(int a,int k){int res=1;while(k){if(k&1)res=res*a%mol;a=a*a%mol;k>>=1;}return res;}
int inv(int x){return qmi(x%mol,mol-2);}
int n,m,q,k;
int work(int x)
{
  return (int)(sqrt(2*x)+1.5);
}
void solve()
{
  int x,y;
  cin>>x>>y;
  if(x>=y)
  {
    cout<<x-y<<endl;
    return ;
  }
  int l=work(x),r=work(y);
  int l1=l*(l-1)/2-x,r1=r*(r-1)/2-y;
  if(l1<=r1)
  {
    cout<<r-l+r1-l1<<endl;
  }
  else cout<<r+r1-l1<<endl;
  
}
signed main()
{
  ios::sync_with_stdio(false); cin.tie(0); cout.tie(0);
  int T = 1;
   cin>>T;
  for (int i = 1; i <= T; i++)solve();
  return 0;
}