res = [1]
s = 1
for i in range(10**5+2):
    s+=2*(i+1)
    res.append(s)
def binaryS(x,n):
    lo = 0
    hi = n+1
    while lo<hi:
        mid = (lo+hi)//2
        midval = res[mid]
        if midval<x:
            lo = mid+1
        elif midval>x:
            hi = mid
        else:
            return mid
    return lo
    
#print(binaryS(10,4),binaryS(13,4),binaryS(15,4))
for lo in range(int(input())):
    n,l,r = map(int,input().split())
    key = binaryS(l,n)
    st = key
    ans = []
    if (res[key]==l):
        st = key+1
        ans.append(1)
        l=l+1
    m = l - res[st-1]
    st+=1
    t = (m+1)//2+1
    if t==st:
        nxt = 1
    else:
        nxt = t
    for i in range(l,r+1):
        #print(nxt,st)
        if(i%2==0):
            ans.append(st)
        else:
            ans.append(nxt)
            if(nxt==1):
                st = st+1
                nxt = 2
            elif(nxt==st-1):
                nxt=1
            else:
                nxt+=1
    print(*ans)
    