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

#define _P(...) (void)printf(__VA_ARGS__)
#define FOR(x,to) for(x=0;x<(to);x++)
#define FORR(x,arr) for(auto& x:arr)
#define FORR2(x,y,arr) for(auto& [x,y]:arr)
#define ALL(a) (a.begin()),(a.end())
#define ZERO(a) memset(a,0,sizeof(a))
#define MINUS(a) memset(a,0xff,sizeof(a))
template<class T> bool chmax(T &a, const T &b) { if(a<b){a=b;return 1;}return 0;}
template<class T> bool chmin(T &a, const T &b) { if(a>b){a=b;return 1;}return 0;}
//-------------------------------------------------------

int T;
ll A,B;

void solve() {
	int i,j,k,l,r,x,y; string s;
	
	cin>>T;
	while(T--) {
		cin>>A>>B;
		vector<ll> C;
		for(i=1;i*i<=A;i++) C.push_back(i),C.push_back(A/i);
		for(i=1;i*i<=B;i++) C.push_back(i),C.push_back(B/i);
		sort(ALL(C));
		C.erase(unique(ALL(C)),C.end());
		reverse(ALL(C));
		C.push_back(0);
		
		ll ret=0;
		FOR(i,C.size()-1) {
			ll AF=A%C[i],BF=B%C[i];
			ll AD=A/C[i],BD=B/C[i];
			int sz=C[i]-C[i+1];
			
			
			if(AD==BD) {
				if(AF>=BF) ret+=sz;
			}
			else if(AF>=BF) {
				ret+=min((ll)sz,(AF-BF)/(BD-AD)+1);
			}
		}
		cout<<ret<<endl;
	}
}


int main(int argc,char** argv){
	string s;int i;
	if(argc==1) ios::sync_with_stdio(false), cin.tie(0);
	FOR(i,argc-1) s+=argv[i+1],s+='\n'; FOR(i,s.size()) ungetc(s[s.size()-1-i],stdin);
	cout.tie(0); solve(); return 0;
}