#include <bits/stdc++.h>
using namespace std;
#define MOD 1000000007
#define MOD2 998244353
#define rep(i,n) for (int i = 0; i < (int)(n); i++)
#define reps(i,s,n) for (int i = (int)(s); i < (int)(n); i++)
#define repit(i,C) for (auto i = (C).begin(); break_flg && (i != (C).end()); i++)
#define repits(i,sitr,C) for (auto i = sitr; break_flg && (i != (C).end()); i++)
#define pr(a) cout << a
#define prl(a) cout << (a) << endl
#define prld(a) cout << setprecision(15)<< (a) << endl 
#define allrange(a) a.begin(),a.end()

/*  divisor(n)
    入力：整数 n
    出力：nのすべての約数
    計算量：O(√n)
*/
vector<int> divisor(int n) {
    vector<int> ret;
    for (int i = 1; i * i <= n; i++) {
        if (n % i == 0) {
            ret.push_back(i);
            if (i * i != n) ret.push_back(n / i);
        }
    }
    sort(ret.begin(), ret.end()); // 昇順に並べる
    return ret;
}

inline bool check(int d1,int d2,int m)
{
    return (d1!=d2) && (((m/d2-m/d1)%(d1-d2)) == 0);
}

int main(){
    int T;
    cin >> T;
    rep(i,T){
        int p,l,r;
        cin >> p >> l >> r;
        int ct = 0;
        reps(k,l,r+1)
        {
            if(k!=p){
            int M = abs(k-p);
            auto d = divisor(M);
            if(d.size()<5) continue;
            ct++;
        /*
            bool break_flg = true;
            repit(itr1,d)
             repits(itr2,itr1+1,d)
                if(check(*itr2,*itr1,M))  repits(itr3,itr2+1,d)
                    if(check(*itr3,*itr2,M))  repits(itr4,itr3+1,d)
                       if(check(*itr4,*itr3,M))  repits(itr5,itr4+1,d)
                         if(check(*itr5,*itr4,M)) { ct++; break_flg=false; break;}
        */
            }else{
              auto d = divisor(abs(k));
              if(d.size()<=5) continue;
              ct++;                
            }
        }
        prl(ct);
    }


}