class Bit:
    def __init__(self, n):
        self.size = n
        self.tree = [0] * (n + 1)
 
    def sum(self, i):
        s = 0
        while i > 0:
            s += self.tree[i]
            i -= i & -i
        return s
 
    def add(self, i, x):
        while i <= self.size:
            self.tree[i] += x
            i += i & -i
N=10**6
v=[0]*(N+1)
from math import isqrt
Q=int(input())
h=[0]*(N+1)
from random import randint
E=1000
for _ in range(Q):
  x,l,r=map(int,input().split())
  k=isqrt(x)
  for y in range(1,k+1):
    z=x//y
    if z>k:
      if v[z]==0:
        v[z]=1
        h[z//1000]+=1
      else:
        v[z]=0
        h[z//1000]-=1
    if v[y]==0:
      v[y]=1
      h[y//1000]+=1
    else:
      v[y]=0
      h[z//1000]-=1
  result=0
  if r-l<=2000:
    for x in range(l,r+1):
      result+=v[x]
  else:
    a=(l+999)//1000
    b=r//1000
    for x in range(a,b):
      result+=h[x]
    for x in range(l,a*1000):
      result+=v[x]
    for x in range(b*1000,r+1):
      result+=v[x]
  print(result)