#include <stdio.h>
#include <time.h>

int TC;
unsigned long num,lo,hi;
unsigned long cnt;

unsigned long idx;
unsigned long ARR[25];  // 2^24 = 16,777,216 , so 25 is enough as max idx.

unsigned long pivot;
unsigned long prime_factor;

unsigned long result;

int main(void)
{
    scanf("%d",&TC);

    for(int i=0;i<TC;i++)
    {
        scanf("%lu %lu %lu",&num,&lo,&hi);

clock_t start = clock();

        for(unsigned long j=lo;j<=hi;j++)
        {
            // init
            pivot = prime_factor = j;
            idx = 0;
            for(unsigned long m=0;m<25;m++)
                ARR[m] = 0;


            // find prime factor
            for(unsigned long n=2;n<=pivot;n++)
            {
                if(prime_factor%n==0) {
                    ARR[idx] = n;
                    idx++;
                    prime_factor = prime_factor/n;
                    n = 1;
                    pivot = prime_factor;
                }
                else
                {
                    if(pivot/n+1 < n) continue; // bug fix
                    pivot = pivot/n+1;
                }
            }


            // add last prime factor. upper code does not add last prime factor... ; bug fix
            if(prime_factor != 1) {
                ARR[idx] = prime_factor;
                idx++;
            }

#if 0
            // for debugging
            if(idx == 1) {
                printf("소수\n");
                cnt = 2;
            }
            else {
                for(int l=0;l<idx;l++) {
                    printf("%d ",ARR[l]);
                }
                printf("\n");
            }
#endif
            // count all divisors
            // 1. sort
            for(unsigned long k=0;k<idx;k++)
            {
                unsigned long temp = 0;
                for(unsigned long k2=k;k2<idx;k2++)
                {
                    if(ARR[k]>ARR[k2]) {
                        temp = ARR[k];
                        ARR[k] = ARR[k2];
                        ARR[k2] = temp;
                    }
                }
            }

            // 2. sum of each prime factor * num
            unsigned long val = ARR[0];
            unsigned long each_cnt = 1;
            cnt = 1;

            for(unsigned long k3=1;k3<=idx;k3++)
            {
                if(val == ARR[k3]) {
                    each_cnt++;
                }
                else {
                    cnt = cnt * (each_cnt+1);
                    val = ARR[k3];
                    each_cnt = 1;
                }
            }

            if(cnt == num) result++;

        }

        printf("%lu\n",result);
printf("time : %d\n",clock()-start);

        result = 0;
    }

    return 0;
}