import sys
import math
import bisect

readLine = lambda : sys.stdin.readline()
readInt = lambda : int(sys.stdin.readline())
readInts = lambda : [int(x) for x in sys.stdin.readline().split(" ")]

def main():
    t = readInt()
    solns = []
    MAX_N = 2 * 10 ** 5
    segStarts = [i * (i - 1) + 1 for i in range(1, MAX_N)]
    segStarts.insert(0, 0)
    for _ in range(t):
        s = []
        n, l, r = readInts()
        # find start of segment containing l
        x_start = bisect.bisect_left(segStarts, l-1)
        offset_x = (l - 1) - segStarts[x_start] # number of terms from seg start to x
        # left offset in node y segment
        maxVal = x_start + 1
        i = maxVal - (offset_x + 1) // 2
        if offset_x == -1:
            i = 1
            maxVal -= 1
        for j in range(l - 1, r):
            if i == 0:
                maxVal += 1
                i = maxVal - 1
            if j % 2 == 1:
                s.append(maxVal)
            else:
                s.append(i)
                i -= 1
        solns.append(" ".join(str(x) for x in s))
    print("\n".join(solns))

main()