#include <bits/stdc++.h>
typedef long long ll;
using namespace std;
void fastIO() {
ios::sync_with_stdio(false);
cin.tie(nullptr);
}
int main() {
fastIO();
ll t;
cin >> t;
while (t--) {
ll n, m;
cin >> n >> m;
// compute maximum g such that g(g-1) <= n:
// g <= (1 + sqrt(1+4n)) / 2
long double D = 1.0L + 4.0L * n;
ll root = (ll)((1.0L + sqrtl(D)) / 2.0L);
// clamp to [0..m]
ll G = min(root, m);
// we need g >= 2 so that a = g*(g-1) >= 1
// count is number of g in [2..G] => max(0, G-1)
ll ans = G >= 2 ? (G - 1) : 0;
cout << ans << "\n";
}
return 0;
}
I2luY2x1ZGUgPGJpdHMvc3RkYysrLmg+CnR5cGVkZWYgbG9uZyBsb25nIGxsOwp1c2luZyBuYW1lc3BhY2Ugc3RkOwoKdm9pZCBmYXN0SU8oKSB7CiAgICBpb3M6OnN5bmNfd2l0aF9zdGRpbyhmYWxzZSk7CiAgICBjaW4udGllKG51bGxwdHIpOwp9CgppbnQgbWFpbigpIHsKICAgIGZhc3RJTygpOwogICAgbGwgdDsgCiAgICBjaW4gPj4gdDsKICAgIHdoaWxlICh0LS0pIHsKICAgICAgICBsbCBuLCBtOwogICAgICAgIGNpbiA+PiBuID4+IG07CiAgICAgICAgLy8gY29tcHV0ZSBtYXhpbXVtIGcgc3VjaCB0aGF0IGcoZy0xKSA8PSBuOgogICAgICAgIC8vIGcgPD0gKDEgKyBzcXJ0KDErNG4pKSAvIDIKICAgICAgICBsb25nIGRvdWJsZSBEID0gMS4wTCArIDQuMEwgKiBuOwogICAgICAgIGxsIHJvb3QgPSAobGwpKCgxLjBMICsgc3FydGwoRCkpIC8gMi4wTCk7CiAgICAgICAgLy8gY2xhbXAgdG8gWzAuLm1dCiAgICAgICAgbGwgRyA9IG1pbihyb290LCBtKTsKICAgICAgICAvLyB3ZSBuZWVkIGcgPj0gMiBzbyB0aGF0IGEgPSBnKihnLTEpID49IDEKICAgICAgICAvLyBjb3VudCBpcyBudW1iZXIgb2YgZyBpbiBbMi4uR10gPT4gbWF4KDAsIEctMSkKICAgICAgICBsbCBhbnMgPSBHID49IDIgPyAoRyAtIDEpIDogMDsKICAgICAgICBjb3V0IDw8IGFucyA8PCAiXG4iOwogICAgfQogICAgcmV0dXJuIDA7Cn0K