'''input
3
2 1 3
3 3 6
99995 9998900031 9998900031
'''

import sys
import math
from collections import Counter

debug = 1
readln = sys.stdin.readline
#sys.setrecursionlimit(1000000)

def write(s):
    sys.stdout.write(str(s))

def writeln(s):
    sys.stdout.write(str(s))
    sys.stdout.write('\n')

def readint():
    return int(readln().strip())

def readints():
    return map(int, readln().split())

def readstr():
    return readln().strip()

def readstrs():
    return readln().split()

def dbg(*args):
    if debug: print(' '.join(map(str, args)))

def solve(n,l,r):
    start = 0
    ans = []
    l, r = l-1, r-1
    for i in xrange(1, n):
        if l < start: break
        next_start = start + (n-i) * 2
        if l < next_start:
            for cl in range(l, min(r+1, next_start)):
                if cl % 2 == 0:
                    ans.append(i)
                else:
                    ans.append((cl - start + 1) / 2 + i)
            l = min(r, next_start)
        start = next_start

    if l == start:
        ans.append(1)

    return ans

t = readint()
for _ in xrange(t):
    n, l, r = readints()
    writeln(' '.join(map(str, solve(n,l,r))))