#include <bits/stdc++.h>
#include <chrono>
using namespace std;
#define endl '\n'
//#define inf 1e18
typedef long long ll;
typedef unsigned long long ull;
typedef __int128 lll;
typedef pair<ll, ll> P;
#define x first
#define y second
#define int long long

// const int p = 1e9 + 7;
const int pp = 998244353;

int dx[8] = {-1, 0, 1, 0, -1, -1, 1, 1}, dy[8] = {0, 1, 0, -1, -1, 1, -1, 1};
int ddx[8] = {1, 1, 2, 2, -1, -1, -2, -2}, ddy[8] = {2, -2, 1, -1, 2, -2, 1, -1};

ll ksm(ll a, ll b, ll p) {
    ll ans = 1;
    while(b) {
        if(b & 1) ans = (ans * a) % p;
        b >>= 1;
        a = (a * a) % p;
    }
    return ans % p;
}

std::mt19937 rng;  // 随机数生成器  
int rand(int l, int r) {
    std::uniform_int_distribution<int> distribution(l, r);
    return distribution(rng);
}

int f(int x) {
    double y = sqrt(2 * x) + 1.5;
    return (int)y;
}

// int n = 20;
void work(int x) {
    cout << f(x) << endl;
}

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

int get(int a, int b) {
    if(a > b) return a - b;
    int st = calc(a);
    int c = b - a;
    int l = 1, r = 2e9;
    while(l < r) {
        int mid = (l + r) >> 1;
        if((st + st + (mid - 1)) * mid / 2 + a >= b) r = mid;
        else l = mid + 1;
    }
    int sum = (st + st + (l - 1)) * l / 2 + a;
    // cout << "k : " << l << ", s : " << sum << endl;
    int ans = l + (sum - b);
    return ans;
}

void solve() {
    int a, b;
    cin >> a >> b;
    if(a >= b) {
        cout << a - b << endl;
        return ;
    }
    int st = calc(a);
    // cout << "st : " << st << endl;
    int ans = get(a, b);
    if(a > 1) {
        int l = 1, r = a - 1;
        while(l < r) {
            int mid = (l + r + 1) >> 1;
            if(calc(mid) < st) l = mid;
            else r = mid - 1;
        }
        int now = get(l, b);
        // cout << "la : " << l << ", now : " << now << endl;
        ans = min(ans, now + a - l);
    }
    cout << ans << endl;
}


/*  



*/

signed main () {
    // init(minp, primes, m); // primes
    // ios::sync_with_stdio(0);
    // cin.tie(0), cout.tie(0);
    // init();
    int _ = 1;
  cin >> _;
    while(_ -- ) {
        solve();
    }
    return 0;
}