#include <bits/stdc++.h>
#include <atcoder/all>
#pragma GCC target("avx2")
#pragma GCC optimize("O3")
#pragma GCC optimize("unroll-loops")
#define SELECTER(_1,_2,_3,SELECT,...) SELECT
#define rep1(i,n) for(int i=0;i<int(n);++i)
#define rep2(i,a,n) for(int i=int(a);i<int(n);++i)
#define rep(...) SELECTER(__VA_ARGS__,rep2,rep1)(__VA_ARGS__)
#define RSELECTER(_1, _2, _3, RSELECT, ...) RSELECT
#define rrep1(i,n) for(int i=(int)(n)-1;i>=0;--i)
#define rrep2(i,a,n) for(int i=(int)(n)-1;i>=(int)a;--i)
#define rrep(...) RSELECTER(__VA_ARGS__, rrep2, rrep1)(__VA_ARGS__)
#define all(a) a.begin(),a.end()
#define rall(a) a.rbegin(),a.rend()
#define fi first
#define se second
#define PrintR LogOutput
#ifdef _DEBUG
#define Log(...) LogOutput(__VA_ARGS__)
#else
#define Log(...)
#endif
#define M_PI 3.14159265358979323846
using namespace std;
using namespace atcoder;
using ll=long long;
using ld=long double;
using pii=pair<int,int>;
using pll=pair<long long,long long>;
using pdd=pair<long double,long double>;
using tp=tuple<int,int,int>;
using tpll=tuple<ll,ll,ll>;
using veci=vector<int>;
using vecpii=vector<pair<int,int>>;
using vecll=vector<long long>;
using vecpll=vector<pair<long long,long long>>;
using vecpdd=vector<pair<long double,long double>>;
using vecs=vector<string>;
using vecb=vector<bool>;
using vecd=vector<long double>;
using vectp=vector<tp>;
using vectpll=vector<tpll>;
using mint=modint998244353;
using mint10=modint1000000007;
template<typename T, typename S>
istream& operator>>(istream& in, pair<T, S>& a){return in >> a.first >> a.second;}
template<typename T, typename S>
ostream& operator<<(ostream& out, const pair<T, S>& a){return out << a.first << ' ' << a.second;}
ostream& operator<<(ostream& out, const mint& a){return out << a.val();}
ostream& operator<<(ostream& out, const mint10& a){return out << a.val();}
ostream& operator<<(ostream& out, const modint& a){return out << a.val();}
template<typename T>
ostream& operator<<(ostream& out, const vector<T>& d){for(int i = 0 ; i < d.size() ; ++i) out << d[i] << (i == d.size() - 1 ? "" : " "); return out;}
template<typename T, typename S>
pair<T, S> operator+(const pair<T, S>& a, const pair<T, S>& b){return {a.fi + b.fi, a.se + b.se};}
template<typename T, typename S>
pair<T, S> operator-(const pair<T, S>& a, const pair<T, S>& b){return {a.fi - b.fi, a.se - b.se};}
template<class T> inline bool chmax(T& a,T b){if(a<b) {a=b;return true;} return false;}
template<class T> inline bool chmin(T& a,T b){if(a>b) {a=b;return true;} return false;}
bool Judge(int i, int j, int h, int w){return i < 0 || j < 0 || i >= h || j >= w;}
bool PrintA(int i){cout<<(i ? "Yes" : "No")<<endl;return i;}

constexpr ll INF=numeric_limits<ll>::max() >> 2;
constexpr int inf=numeric_limits<int>::max() >> 1;
constexpr ll MOD=998244353;
const int vi[] = {0, 1, 0, -1}, vj[] = {1, 0, -1, 0};

template<typename... Args>
void LogOutput(Args&&... args){
	stringstream ss;
	((ss << args << ' '), ...);
	cout << ss.str().substr(0, ss.str().length() - 1) << endl;
}
template<typename T>
void LogOutput(vector<vector<T>>& data){for(auto d : data) LogOutput(d);}

int main(){
	ios::sync_with_stdio(false);
	std::cin.tie(nullptr);
	int test;cin>>test;
	rep(_, test){
		int a, b;cin>>a>>b;
		int sq = sqrt(a);
		ll ans = 0;
		{
			int m = b / (a + 1);
			rep(i, 1, m + 1){
				int l = b / (i + 1) + 1, r = b / i;
				if(r <= a || l > b) continue;
				chmax(l, a + 1);
				chmin(r, b);
				int u = a % l >= b % l;
				int bsl = l, bsr = r;
				l--, r++;
				while(r - l > 1){
					int mid = (l + r) / 2;
					if(a >= b % bsl - (mid - bsl) * i){
						if(u) l = mid;
						else r = mid;
					}else{
						if(u) r = mid;
						else l = mid;
					}
				}
				if(u) ans += l - bsl + 1;
				else ans += bsr - r + 1;
			}
		}
		rep(i, 1, sq + 1) ans += a % i >= b % i;
		rep(i, 1, sq + 1){
			int l = a / (i + 1) + 1, r = a / i;
			if(r <= sq) continue;
			chmax(l, sq + 1);
			int lb = b / l, rb = b / r;
			rep(j, rb, lb + 1){
				int l2 = b / (j + 1) + 1, r2 = b / j;
				chmax(l2, l);
				chmin(r2, r);
				int bsl = l2, bsr = r2;
				int u = a % l2 >= b % l2;
				l2--, r2++;
				while(r2 - l2 > 1){
					int mid = (l2 + r2) / 2;
					if(a % l - (mid - l) * i >= b % bsl - (mid - bsl) * j){
						if(u) l2 = mid;
						else r2 = mid;
					}else{
						if(u) r2 = mid;
						else l2 = mid;
					}
				}
				ll p = ans;
				if(u) ans += l2 - bsl + 1;
				else ans += bsr - r2 + 1;
			}
		}
		cout<<ans<<endl;
	}
}