#include <iostream>
#include <cstdio>
#include <algorithm>
#include <cmath>
using namespace std;
typedef unsigned long long ll;
int t;
ll n, e, d;

int main() {
	scanf("%d", &t);
	while (t--) {
		scanf("%llu %llu %llu", &n, &e, &d);
		int flag = 0;
		ll ed = e * d, i = 1;
		ll sum = 2 + n - ed;
		if (ed == 1) {
			if (sum - 1 == n)
				printf("1 %llu\n", sum - 1);
			else
				printf("NO\n");
			continue;
		}
		ll c = sum / 2;
		while (i <= c) {
			ll q = sum - i;
			if (q * i == n) {
				printf("%llu %llu\n", i, q);
				flag = 1;
				break;
			}
			i++;
		}
		if (!flag)
			printf("NO\n");
	}
	return 0;
}/*
10
770 77 5
633 1 211
545 1 499
683 3 227
858 3 257
723 37 13
572 26 11
867 17 17
829 3 263
528 4 109
answer:
2 385
NO
NO
NO
11 78
3 241
2 286
NO
NO
6 88
*/