#include <iostream>
#include <string>
#include <cmath>
using namespace std;
bool is_prime(long long n) {
if (n <= 1) return false;
if (n == 2) return true;
if (n % 2 == 0) return false;
for (long long i = 3; i * i <= n; i += 2) {
if (n % i == 0) return false;
}
return true;
}
void solve() {
long long x, k;
cin >> x >> k;
if (k == 1) {
if (is_prime(x)) {
cout << "YES" << endl;
} else {
cout << "NO" << endl;
}
} else {
cout << "NO" << endl;
}
}
int main() {
int t;
cin >> t;
while (t--) {
solve();
}
return 0;
}
I2luY2x1ZGUgPGlvc3RyZWFtPgojaW5jbHVkZSA8c3RyaW5nPgojaW5jbHVkZSA8Y21hdGg+Cgp1c2luZyBuYW1lc3BhY2Ugc3RkOwoKYm9vbCBpc19wcmltZShsb25nIGxvbmcgbikgewogICAgaWYgKG4gPD0gMSkgcmV0dXJuIGZhbHNlOwogICAgaWYgKG4gPT0gMikgcmV0dXJuIHRydWU7CiAgICBpZiAobiAlIDIgPT0gMCkgcmV0dXJuIGZhbHNlOwogICAgZm9yIChsb25nIGxvbmcgaSA9IDM7IGkgKiBpIDw9IG47IGkgKz0gMikgewogICAgICAgIGlmIChuICUgaSA9PSAwKSByZXR1cm4gZmFsc2U7CiAgICB9CiAgICByZXR1cm4gdHJ1ZTsKfQoKdm9pZCBzb2x2ZSgpIHsKICAgIGxvbmcgbG9uZyB4LCBrOwogICAgY2luID4+IHggPj4gazsKICAgIGlmIChrID09IDEpIHsKICAgICAgICBpZiAoaXNfcHJpbWUoeCkpIHsKICAgICAgICAgICAgY291dCA8PCAiWUVTIiA8PCBlbmRsOwogICAgICAgIH0gZWxzZSB7CiAgICAgICAgICAgIGNvdXQgPDwgIk5PIiA8PCBlbmRsOwogICAgICAgIH0KICAgIH0gZWxzZSB7CiAgICAgICAgY291dCA8PCAiTk8iIDw8IGVuZGw7CiAgICB9Cn0KCmludCBtYWluKCkgewogICAgaW50IHQ7CiAgICBjaW4gPj4gdDsKICAgIHdoaWxlICh0LS0pIHsKICAgICAgICBzb2x2ZSgpOwogICAgfQogICAgcmV0dXJuIDA7Cn0=