#include <bits/stdc++.h>
using namespace std;
using ll = long long;

vector<tuple<ll, ll, ll>> Enum_floor(ll n) {
  vector<tuple<ll, ll, ll>> ret;
  ll l = 1;
  while(l <= n) {
    ll q = n / l, r = n / q + 1;
    ret.push_back({l, r, q});
    l = r;
  }
  return ret;
}

auto ceil(auto a, auto b) {
  assert(b != 0);
  if(b < 0) { a = -a, b = -b; }
  return a / b + (a % b > 0);
}

void solve() {
  ll A, B;
  cin >> A >> B;

  auto a = Enum_floor(A), b = Enum_floor(B);
  vector<ll> v;
  for(auto &[l, r, q] : a) {
    v.emplace_back(l);
    v.emplace_back(r);
  }
  for(auto &[l, r, q] : b) {
    v.emplace_back(l);
    v.emplace_back(r);
  }

  ranges::sort(v);
  v.erase(unique(v.begin(), v.end()), v.end());

  ll N = v.size();
  vector<ll> s(N - 1, 0);
  for(ll i = 0; i < N - 1; i++) {
    s[i] -= A / v[i];
    s[i] += B / v[i];
  }

  ll ans = 0;
  for(ll i = 0; i < N - 1; i++) {
    if(s[i]) { ans += max(v[i + 1] - max(v[i], ceil(B - A, s[i])), 0LL); }
  }

  cout << ans << "\n";
}

int main() {
  ios::sync_with_stdio(false);
  cin.tie(nullptr);
  ll t;
  cin >> t;
  while(t--) { solve(); }
}