def main():
    n, l, r = list(map(int, input().split()))
    D = {}
    a = 2
    m = n
    while a*a <= m:
        c = 0
        while not m % a:
            c += 1
            m //= a
        if c:
            D[a] = c
        a += 1
    if m-1:
        D[m] = 1
    C = set()
    a = 1
    while a*a <= n:
        if not n % a:
            C.add(a)
            C.add(n//a)
        a += 1
    C = list(C)
    E = list(D.keys())
    N = len(D)
    dp = [[] for _ in range(1<<N)]
    X = []
    for a in C:
        if l <= a <= r:
            b = a
            X.append(a)
            t = 0
            for i in range(N):
                d = E[i]
                c = 0
                while not a % d:
                    c += 1
                    a //= d
                if c == D[d]:
                    t |= 1 << i
            dp[t].append(b)
    for i in range(N):
        for bit in range(1<<N):
            if not bit >> i & 1:
                for j in range(max(0, min(3-len(dp[bit]), len(dp[bit|1<<i])))):
                    dp[bit].append(dp[bit|1<<i][j])
    #print(dp)
    for bit0 in range(1<<N):
        if not dp[bit0]: continue
        x0 = dp[bit0][0]
        for bit1 in range(1<<N):
            i = 0
            x1 = -1
            while i < len(dp[bit1]):
                if x0 != dp[bit1][i]:
                    x1 = dp[bit1][i]
                    break
                else:
                    i += 1
            if x1 == -1: continue
            bit2 = (1<<N)-1 ^ (bit0 | bit1)
            i = 0
            x2 = -1
            while i < len(dp[bit2]):
                if x0 != dp[bit2][i] and x1 != dp[bit2][i]:
                    x2 = dp[bit2][i]
                    break
                else:
                    i += 1
            if x2 != -1:
                return sorted([x0, x1, x2])
    return [-1]
for _ in range(int(input())):
    print(*main())