#include <bits/stdc++.h>
#include <atcoder/all>

using namespace std;
using ll = long long;
#define rep(i, s, t) for (ll i = s; i < (ll)(t); i++)
#define all(x) begin(x), end(x)
template <class T> bool chmin(T& x, T y) {
	return x > y ? (x = y, true) : false;
}
template <class T> bool chmax(T& x, T y) {
	return x < y ? (x = y, true) : false;
}

vector<ll> dv(ll x) {
	vector<ll> rt;
	for (ll i = 1; i * i <= x; i++) {
		if (x % i == 0) {
			rt.push_back(i);
			if (i * i != x) rt.push_back(x / i);
		}
	}
	sort(rt.begin(), rt.end());
	return rt;
}

void solve() {
	ll n, l, r;
	cin >> n >> l >> r;
	r++;
	if (n < l || r - l < 3) {
		cout << "-1\n";
		return;
	}
	vector<ll> d;
	for (auto x : dv(n))
		if (l <= x && x < r) d.push_back(x);
	vector<ll> ans;
	ll lc = d.back();
	ans.push_back(d.back());
	d.pop_back();
	reverse(all(d));
	for (ll x : d) {
		if (lc == n && ans.size() < 3) ans.push_back(x);
		else if (lc % x != 0) {
			lc = lcm(lc, x);
			ans.push_back(x);
		}
	}
	sort(all(ans));
	if (lc != n || (int)ans.size() != 3) cout << "-1\n";
	else cout << ans[0] << ' ' << ans[1] << ' ' << ans[2] << '\n';
}

int main() {
	ios::sync_with_stdio(false);
	cin.tie(nullptr);
	cout << fixed << setprecision(15);
	int t = 1;
	cin >> t;
	while (t--) solve();
}