from math import sqrt, lcm

def factorization(n: int) -> list[int]:
    '''
    素因数分解。
    see: https://qiita.com/gafugafu/items/482e29b879f2a827a53d
    '''
    factors: list[int] = []
    if n < 1:
        return [-1]
    elif n == 1:
        return [1]

    n1 = n
    for i in range(2, int(sqrt(n))+1):
        if n1 % i == 0:
            while n1 % i == 0:
                n1//=i
                factors.append(i)
                if n1 == 1:
                    return factors
    if n1 != 1:
        factors.append(n1)
        return factors
    elif factors == []:
        return [n]
    return []

def divisors(n: int) -> list[int]:
    '''
    約数全列挙
    '''
    factors = factorization(n)

    ds = [1]

    for p in factors:
        l = len(ds)
        for i in range(l):
            ds.append(p * ds[i])

    ds.sort()
    return sorted(set(ds), key=ds.index)

def solve():
    N, L, R = map(int, input().split())
    assert 1 <= N <= 1_000_000_000
    assert 1 <= L <= R <= 1_000_000_000
    D = divisors(N) # len(D) = O(N^{1/3}) ~ 10^3
    DD = [d for d in D if L <= d <= R]
    lDD = len(DD)
    for i in range(lDD):
        for j in range(i+1, lDD):
            for k in range(j+1, lDD):
                if lcm(DD[i], DD[j], DD[k]) == N:
                    return [DD[i], DD[j], DD[k]]
    return [-1]

T = int(input())
assert 1 <= T <= 1000
for _ in range(T):
    print(*solve())