#include<iostream>
#include<algorithm>
#include<cstdio>
#include<cstdlib>

using namespace std;

int main()
{
    int t;
    cin>>t;
    for(int w=0;w<t;w++){
        unsigned long long n,k;
        cin>>n>>k;
        unsigned long long i,j;
        unsigned long long count1=0ULL;
        unsigned long long count2=0ULL;
        unsigned long long x=3ULL*n;
        unsigned long long y=4ULL*n*n;
        x=min(x,k-n);
        y=min(y,k-n);

        for(i=1ULL;i<x;i++){
            for(j=i;j<y;j++){
                unsigned long long q=i*j;
                unsigned long long rem=((n%q)*((i+j+n-1)%q))%q;
                if((rem==0ULL)&&(i==j))
                        count1++;
                if((rem==0ULL)&&(i!=j))
                        count2++;

            }
        }

        unsigned long long count=count1+(2ULL * count2);

        cout<<count<<"\n";

    }

    return 0;
}