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())
Z=Bit(N+1)
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
        Z.add(z,1)
      else:
        v[z]=0
        Z.add(z,-1)
    if v[y]==0:
      v[y]=1
      Z.add(y,1)
    else:
      v[y]=0
      Z.add(y,-1)
  result=Z.sum(r)
  if l>0:
    result-=Z.sum(l-1)
  print(result)