def search(X, l=0, r=100010) :
  if r <= l : return l
  n = (r+l) // 2
  v = 1+n*(n-1)
  if X < v : return search(X, l, n)
  elif X > v : return search(X, n+1, r)
  else : return n

T = input()
for t in range(T) :
  N, L, R = map(int,raw_input().split())

  lSec = search(L)
  rSec = search(R)
  
  lBase = 1+(lSec-1)*(lSec-2) if lSec > 1 else 0
  rBase = 1+(rSec-1)*(rSec-2) if rSec > 1 else 0
  
  extraL = L-lBase
  extraR = R-rBase

  # extra on the left
  res = [] if lSec > 1 or rSec == 1 else [1]
  for i in range(extraL, (lSec-1)*2+1 if lSec < rSec else extraR+1) :
    if i%2 == 0 : res.append(i//2+1 if i//2+1 != lSec else 1)
    else : res.append(lSec)


  # middle chunks
  for i in range(lSec+1, rSec) :
    for j in range(1,(i-1)*2+1) :
      if j%2 == 0 : res.append(j//2+1 if j//2+1 != i else 1)
      else : res.append(i)

  if (lSec < rSec) :
    # right chunks
    for i in range(1,extraR+1) :
      if i%2 == 0 : res.append(i//2+1 if i//2+1 != rSec else 1)
      else : res.append(rSec)
  
  print ' '.join(str(x) for x in res)