#include <bits/stdc++.h>

using namespace std;

typedef long long ll;

const int N = 2e5 + 2;

int a[N];
int prime[N], vis[N], cnt;
ll ans;
vector<int> pa, pb;

void init(int n) {
	for (int i = 2; i <= n; ++i) {
		if (!vis[i]) prime[cnt++] = i;
		for (int j = 0; j < cnt && i * prime[j] <= n; ++j) {
			vis[i * prime[j]] = 1;
			if (i % prime[j] == 0) {
				break;
			}
		}
	}
}

int main() {
#ifndef ONLINE_JUDGE
	freopen("in.txt", "r", stdin);
	freopen("out.txt", "w", stdout);
#endif
	init(100000);
	int T;
	scanf("%d", &T);
	while(T--) {
		pa.clear(); pb.clear();
		int a, b, k;
		scanf("%d%d%d", &a, &b, &k);
		int a_ = a, b_ = b;
		for (int i = 0; prime[i] * prime[i] <= a; ++i) {
			if (a % prime[i] == 0) {
				while(a % prime[i] == 0) {
					a /= prime[i];
					pa.push_back(prime[i]);
				}
			}
		}
		if (a != 1) {
			pa.push_back(a);
		}
		for (int i = 0; prime[i] * prime[i] <= b; ++i) {
			if (b % prime[i] == 0) {
				while(b % prime[i] == 0) {
					b /= prime[i];
					pb.push_back(prime[i]);
				}
			}
		}
		if (b != 1) {
			pb.push_back(b);
		}
		int all = (int)pa.size() + (int)pb.size();
		if (k == 1 && (a_ % b_ == 0 || b_ % a_ == 0) && a_ != b_) {
			printf("YES\n");
		}
		else if (k == 1 && all > 1) {
			printf("NO\n");
		}
		else if (all >= k) {
			printf("YES\n");
		}
		else {
			printf("NO\n");
		}
	}
}