#include <bits/stdc++.h>
using namespace std;

long long gcd(long long x, long long y) {
    if (x < y) swap(x, y);
    while (y > 0) {
        long long r = x % y;
        x = y;
        y = r;
    }
    return x;
}

long long lcm(long long x, long long y) {
    return x * y / gcd(x, y);
}

int main() {
	long long T; cin >> T;
	for (int i = 0; i < T; i++) {
		long long N, A, B;
		cin >> N >> A >> B;
		if (gcd(gcd(N, A), B) == 1) cout << "YES" << endl;
		else cout << "NO" << endl;
	}
}