#include<iostream>
#include<cstdio>
#include<cmath>
#include<algorithm>
#include<cstdio>

using namespace std;

int main()
{
    int t;
    cin>>t;
    for(int w=0;w<t;w++){
        unsigned long long n,k;
        unsigned long long i,j;
        cin>>n>>k;
        unsigned long long num=0;
        unsigned long long z=((2*n*n)-n);

        for(i=1;((i-n)*(i-n))<=z;i++){
            for(j=i;j<=k-n;j++){
                unsigned long long m= ((n%j)*((i+n-1)%j))%j;
                unsigned long long nn=i*j;
                unsigned long long g=((n%nn)*((i+j+n-1)%nn))%nn;
                if((m==0)&&(g==0))
                    num++;
            }
        }

        cout<<num<<"\n";

    }

    return 0;
}