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
Z=Bit(10**6+1)
Q=int(input())
v=[0]*(10**6+1)
for x in range(1,10**6):
  for y in range(2,10**6+1):
    if x*y>10**6:
      break
    v[x*y]=x
pos=0
result=[0]*Q
L=[]
for i in range(Q):
  l,r=map(int,input().split())
  L.append((r,l,i))
L.sort()
for i in range(Q):
  r,l,e=L[i][:]
  for y in range(pos+1,r+1):
    Z.add(v[y]+1,1)
  pos=r
  ans=Z.sum(l)-(l-1)
  result[e]=ans
for i in range(Q):
  print(result[i])