# haru: pypy
import sys
input = sys.stdin.readline
II = lambda : int(input())
MI = lambda : map(int, input().split())
LI = lambda : [int(a) for a in input().split()]
SI = lambda : input().rstrip()
LLI = lambda n : [[int(a) for a in input().split()] for _ in range(n)]
LSI = lambda n : [input().rstrip() for _ in range(n)]
MI_1 = lambda : map(lambda x:int(x)-1, input().split())
LI_1 = lambda : [int(a)-1 for a in input().split()]

mod = 998244353
inf = 1001001001001001001
ordalp = lambda s : ord(s)-65 if s.isupper() else ord(s)-97
ordallalp = lambda s : ord(s)-39 if s.isupper() else ord(s)-97
yes = lambda : print("Yes")
no = lambda : print("No")
yn = lambda flag : print("Yes" if flag else "No")

prinf = lambda ans : print(ans if ans < 1000001001001001001 else -1)
alplow = "abcdefghijklmnopqrstuvwxyz"
alpup = "ABCDEFGHIJKLMNOPQRSTUVWXYZ"
alpall = "abcdefghijklmnopqrstuvwxyzABCDEFGHIJKLMNOPQRSTUVWXYZ"
URDL = {'U':(-1,0), 'R':(0,1), 'D':(1,0), 'L':(0,-1)}
DIR_4 = [[-1,0],[0,1],[1,0],[0,-1]]
DIR_8 = [[-1,0],[-1,1],[0,1],[1,1],[1,0],[1,-1],[0,-1],[-1,-1]]
DIR_BISHOP = [[-1,1],[1,1],[1,-1],[-1,-1]]
prime60 = [2,3,5,7,11,13,17,19,23,29,31,37,41,43,47,53,59]
sys.set_int_max_str_digits(0)
# sys.setrecursionlimit(10**6)
# import pypyjit
# pypyjit.set_param('max_unroll_recursion=-1')

from collections import defaultdict,deque
from heapq import heappop,heappush
from bisect import bisect_left,bisect_right
DD = defaultdict
BSL = bisect_left
BSR = bisect_right


from functools import cache

@cache
def primefact(n:int) -> dict[int,int]:
    p = 2
    res = dict()
    while p*p <= n:
        cnt = 0
        while n%p == 0:
            n //= p
            cnt += 1
        if cnt:
            res[p] = cnt
        p += 1
    if n != 1:
        res[n] = 1
    return res

@cache
def divisors(n:int) -> list[int]:
    divs_small, divs_big = [], []
    i = 1
    while i*i <= n:
        if n % i == 0:
            divs_small.append(i)
            if i != n//i:
                divs_big.append(n//i)
        i += 1
    return divs_small + divs_big[::-1]

from math import lcm

def solve():
    n, l, r = MI()
    
    pf = primefact(n)
    ds = divisors(n)
    
    d = len(pf)
    
    q = []
    for p, e in pf.items():
        q.append(p ** e)
    
    ok = []
    use = [0] * (1 << d)
    el = []
    for x in ds:
        if l <= x <= r:
            bit = 0
            for i, p in enumerate(q):
                if x % p == 0:
                    bit |= 1 << i
            if use[bit] < 1:
                ok.append((x, bit))
                bit += 1
            elif len(el) < 3:
                el.append(bit)
    
    d = len(q)
    dp = [[None] * (1 << d) for _ in range(3)]
    # dp[0][0] = []

    for x, b in ok:
        for k in reversed(range(2)):
            for s in range(1 << d):
                if dp[k][s] != None:
                    dp[k+1][s | b] = dp[k][s] + (x,)
        if dp[0][b] == None:
            dp[0][b] = (x,)
    
    for i in range(1, 3):
        ans = dp[i][-1]
        if ans != None:
            ans += tuple(el)
            if len(ans) >= 3:
                print(*ans[:3])
                return 
    print(-1)
    return

t = int(input())
for i in range(t):
    solve()