# ------------------- fast io --------------------
import os
import sys
from io import BytesIO, IOBase

BUFSIZE = 8192


class FastIO(IOBase):
    newlines = 0

    def __init__(self, file):
        self._fd = file.fileno()
        self.buffer = BytesIO()
        self.writable = "x" in file.mode or "r" not in file.mode
        self.write = self.buffer.write if self.writable else None

    def read(self):
        while True:
            b = os.read(self._fd, max(os.fstat(self._fd).st_size, BUFSIZE))
            if not b:
                break
            ptr = self.buffer.tell()
            self.buffer.seek(0, 2), self.buffer.write(b), self.buffer.seek(ptr)
        self.newlines = 0
        return self.buffer.read()

    def readline(self):
        while self.newlines == 0:
            b = os.read(self._fd, max(os.fstat(self._fd).st_size, BUFSIZE))
            self.newlines = b.count(b"\n") + (not b)
            ptr = self.buffer.tell()
            self.buffer.seek(0, 2), self.buffer.write(b), self.buffer.seek(ptr)
        self.newlines -= 1
        return self.buffer.readline()

    def flush(self):
        if self.writable:
            os.write(self._fd, self.buffer.getvalue())
            self.buffer.truncate(0), self.buffer.seek(0)


class IOWrapper(IOBase):
    def __init__(self, file):
        self.buffer = FastIO(file)
        self.flush = self.buffer.flush
        self.writable = self.buffer.writable
        self.write = lambda s: self.buffer.write(s.encode("ascii"))
        self.read = lambda: self.buffer.read().decode("ascii")
        self.readline = lambda: self.buffer.readline().decode("ascii")


sys.stdin, sys.stdout = IOWrapper(sys.stdin), IOWrapper(sys.stdout)
input = lambda: sys.stdin.readline().rstrip("\r\n")

# ------------------- fast io --------------------

for _ in range(int(input())):
    n, l, r = map(int, input().split())
    p1, p2 = 0, 0
    if l == n**2 - n + 1:
        print(1)
        continue
    else:
        total = 2*(n-1)
        x=1
        while l>total:
            x+=1
            total += 2*(n-x)
        total -= 2*(n-x)
        ans = []
        if not (l - total) % 2:
            ans += [x+(l-total)//2]
            if ans[-1] != n:
                p1, p2 = x, ans[-1]
            else:
                p1, p2 = x+1, x+2
        else:
            p1, p2 = x, x+(l-total)//2+1

        req = r-l+1
        while len(ans) < req:
            ans += [p1, p2]
            #print(ans)
            if p2 == n:
                if p1 == n-1:
                    p1 = 1
                else:
                    p1 += 1
                    p2 = p1+1
            else:
                p2 += 1

    print(" ".join(str(ans[k]) for k in range(r-l+1)))
