#include<bits/stdc++.h>
using namespace std;
typedef long long  ll;
vector<ll>v,faf;
int main()
{
    ll a,b,c,n,t;


    scanf("%lld",&t);

    for(ll i=0;i<n;++i){
        ll cc=0;
        faf.clear();
        v.clear();
        scanf("%lld %lld %lld %lld",&n,&a,&b,&c);

        for(ll j=1;j*j<=n;++j){
            if(n%j==0){
                v.push_back(j);
                v.push_back(n/j);
            }
        }
        sort(v.begin(),v.end());
        for(ll j=0;j<v.size();++j){
            if(v[j]==v[j+1] && (j+1)<v.size())continue;
            faf.push_back(v[j]);
        }


        for(ll j=0;j<faf.size();++j){
                ll x= n/faf[j];
                if(faf[j]<=a){
                    for(ll k=0;k<faf.size();++k){
                        if(x%faf[k]==0 && faf[k]<=b){
                            if(x/faf[k]<=c)++cc;
                        }
                    }
                }

        }


        printf("%lld\n",cc);
    }

}