#include <bits/stdc++.h>
using namespace std;
typedef signed long long ll;

#define _P(...) (void)printf(__VA_ARGS__)
#define FOR(x,to) for(x=0;x<(to);x++)
#define FORR(x,arr) for(auto& x:arr)
#define FORR2(x,y,arr) for(auto& [x,y]:arr)
#define ALL(a) (a.begin()),(a.end())
#define ZERO(a) memset(a,0,sizeof(a))
#define MINUS(a) memset(a,0xff,sizeof(a))
template<class T> bool chmax(T &a, const T &b) { if(a<b){a=b;return 1;}return 0;}
template<class T> bool chmin(T &a, const T &b) { if(a>b){a=b;return 1;}return 0;}
//-------------------------------------------------------

int T;
ll N,L,R;
vector<int> cand[1<<9];

void solve() {
	int i,j,k,l,r,x,y; string s;
	
	cin>>T;
	while(T--) {
		int mask;
		FOR(mask,1<<9) cand[mask].clear();
		cin>>N>>L>>R;
		vector<int> V;
		for(i=1;i*i<=N;i++) if(N%i==0) {
			V.push_back(i);
			if(i*i!=N) V.push_back(N/i);
		}
		map<int,int> M;
		y=N;
		for(x=2;x*x<=y;x++) if(y%x==0) {
			M[x]=1;
			while(y%x==0) {
				M[x]*=x;
				y/=x;
			}
		}
		if(y>1) M[y]=y;
		vector<int> D;
		FORR2(a,b,M) D.push_back(b);
		int ND=D.size();
		FORR(v,V) {
			if(v<L||v>R) continue;
			mask=0;
			FOR(i,ND) if(v%D[i]==0) mask|=1<<i;
			cand[mask].push_back(v);
		}
		FOR(i,ND) {
			FOR(mask,1<<ND) {
				if(mask&(1<<i)) {
					FORR(a,cand[mask]) cand[mask^(1<<i)].push_back(a);
				}
			}
			FOR(mask,1<<ND) {
				if(cand[mask].size()>3) cand[mask].resize(3);
			}
		}
		vector<int> ret;
		FOR(mask,1<<ND) if(ret.empty()) {
			int ma=(1<<ND)-1-mask;
			for(int sm=mask;sm>=0;sm--) if(ret.empty()) {
				sm=sm&mask;
				int sm2=mask^sm;
				FORR(a,cand[ma]) FORR(b,cand[sm]) FORR(c,cand[sm2]) {
					if(a!=b&&a!=c&&b!=c) ret={a,b,c};
				}
			}
		}
		sort(ALL(ret));
		if(ret.empty()) cout<<-1<<endl;
		else cout<<ret[0]<<" "<<ret[1]<<" "<<ret[2]<<endl;
			
		
	}
}


int main(int argc,char** argv){
	string s;int i;
	if(argc==1) ios::sync_with_stdio(false), cin.tie(0);
	FOR(i,argc-1) s+=argv[i+1],s+='\n'; FOR(i,s.size()) ungetc(s[s.size()-1-i],stdin);
	cout.tie(0); solve(); return 0;
}