#include <bits/stdc++.h>
using namespace std;
long long k, n[100100], e[100100], d[100100], x = 0, flag = 0;
int main() {
	cin >> k;
	for (int i = 1; i <= k; i++) {
		cin >> n[i] >> d[i] >> e[i];
		for (long long j = 1; j * j <= n[i]; j++) {
			x = n[i] / j;
			if (n[i] == x * j && e[i]*d[i] == (x - 1) * (j - 1) + 1) {
				flag = 1;
				cout << min(x, j) << ' ' << max(x, j) << "\n";
				break;
			}
		}
		if (flag == 0)
			cout << "NO" << "\n";
		flag = 0;
	}
	return 0;
}