#include <bits/stdc++.h>
using namespace std;
using ll=long long;
const ll ILL=2167167167167167167;
const int INF=2100000000;
#define rep(i,a,b) for (int i=(int)(a);i<(int)(b);i++)
#define all(p) p.begin(),p.end()
template<class T> using pq_ = priority_queue<T, vector<T>, greater<T>>;
template<class T> int LB(vector<T> &v,T a){return lower_bound(v.begin(),v.end(),a)-v.begin();}
template<class T> int UB(vector<T> &v,T a){return upper_bound(v.begin(),v.end(),a)-v.begin();}
template<class T> bool chmin(T &a,T b){if(b<a){a=b;return 1;}else return 0;}
template<class T> bool chmax(T &a,T b){if(a<b){a=b;return 1;}else return 0;}
template<class T> void So(vector<T> &v) {sort(v.begin(),v.end());}
template<class T> void Sore(vector<T> &v) {sort(v.begin(),v.end(),[](T x,T y){return x>y;});}
bool yneos(bool a,bool upp=false){if(a){cout<<(upp?"YES\n":"Yes\n");}else{cout<<(upp?"NO\n":"No\n");}return a;}
template<class T> void vec_out(vector<T> &p,int ty=0){
    if(ty==2){cout<<'{';for(int i=0;i<(int)p.size();i++){if(i){cout<<",";}cout<<'"'<<p[i]<<'"';}cout<<"}\n";}
    else{if(ty==1){cout<<p.size()<<"\n";}for(int i=0;i<(int)(p.size());i++){if(i) cout<<" ";cout<<p[i];}cout<<"\n";}}
template<class T> T vec_min(vector<T> &a){assert(!a.empty());T ans=a[0];for(auto &x:a) chmin(ans,x);return ans;}
template<class T> T vec_max(vector<T> &a){assert(!a.empty());T ans=a[0];for(auto &x:a) chmax(ans,x);return ans;}
template<class T> T vec_sum(vector<T> &a){T ans=T(0);for(auto &x:a) ans+=x;return ans;}
int pop_count(long long a){int res=0;while(a){res+=(int)(a&1),a>>=1;}return res;}
template<class T> T square(T a){return a * a;}



//Nの正の約数を列挙する
vector<long long> Divisors(long long N){
    vector<long long> p,q;
    long long i=1,K=0;
    while(i*i<N){
        if(N%i==0){
            p.push_back(i);
            q.push_back(N/i);
            K++;
        }
        i++;
    }
    if(i*i==N) p.push_back(i);
    for(int i=K-1;i>=0;i--){
        p.push_back(q[i]);
    }
    return p;
}


// return val=p(N)
// a=p[0].first^p[0].second * ... *p[N-1].first^p[N-1].second
// for all i: p[i].first is prime number
// O(sqrt(val))
std::vector<std::pair<long long,long long>> Prime_factorization(long long val){
    assert(val>=1);
    if(val==1){
        return {};
    }
    int ind=0;
    std::vector<std::pair<long long,long long>> ans;
    for(long long i=2;i*i<=val;i++){
        if(val%i!=0) continue;
        ans.push_back({i,0});
        while(val%i==0){
            ans[ind].second++;
            val/=i;
        }
        ind++;
    }
    if(val!=1) ans.push_back({val,1});
    return ans;
}

void solve();
// DEAR MYSTERIES / TOMOO
int main() {
    ios::sync_with_stdio(false);
    cin.tie(nullptr);

    int t = 1;
    cin >> t;
    rep(i, 0, t) solve();
}

void solve(){
    ll N, L, R;
    cin >> N >> L >> R;
    auto D = Divisors(N);
    int a = LB(D, L);
    int b = UB(D, R);
    if (b - a < 3) {
        cout << "-1\n";
        return;
    }
    auto P = Prime_factorization(N);
    int M = P.size();
    vector<ll> G(1 << M, -1);
    vector<ll> q(M, 1);
    rep(i, 0, M) {
        rep(rp, 0, P[i].second) q[i] *= P[i].first;
    }
    rep(i, a, b) {
        int ind = 0;
        rep(j, 0, M) {
            if (D[i] % q[j] == 0) ind += (1 << j);
        }
        G[ind] = D[i];
    }
    rep(i, 0, 1 << M) rep(j, 0, M) if (i & (1 << j)) chmax(G[i - (1 << j)], G[i]);
    int th = 1;
    rep(i, 0, M - 1) th *= 3;
    rep(rp, 0, th) {
        int tmp = rp;
        vector<int> p(3);
        p[0] = 1;
        rep(j, 0, M - 1) {
            p[tmp % 3] += (2 << j);
            tmp /= 3;
        }
        if (min(G[p[0]], min(G[p[1]], G[p[2]])) != -1) {
            set<ll> s;
            rep(i, 0, 3) s.insert(G[p[i]]);
            rep(i, a, b) if ((int)s.size() != 3) s.insert(D[i]);
            vector<ll> ans;
            for (auto x : s) ans.push_back(x);
            vec_out(ans);
            return;
        }
    }
    cout << "-1\n";
}

/*
 * 数を 1 つ固定すると、それ以外の lcm を a の倍数にしてくださいという問題になる
 * a をさらに分解すると、わかる？
 * N の素因数ごとに分担をして、考える
 * 素因数の数は高々 9 個
 * 3^8 = 81 * 81 = 6400
 * まあいけるか
 *
 */