#include <iostream>
using namespace std;
bool isprime(int x)
{
for (int i = 2; i * i <= x; i++)
if (x % i == 0)
return false;
return true;
}
bool isSumOfKprimes(int N, int K)
{
if (N < 2*K)
return false;
if (K == 1)
return isprime(N);
if (K == 2)
{
if (N % 2 == 0)
return true;
return isprime(N - 2);
}
return true;
}
void printResult(int n){
int arr[2][2] = {{13,2},{7,4}};
for(int i=0;i<n;i++){
int x = arr[i][0],y = arr[i][1];
if(isSumOfKprimes(x,y))cout<<"YES\n";
else cout<<"NO\n";
}
}
int main() {
// your code goes here
printResult(2);
return 0;
}
I2luY2x1ZGUgPGlvc3RyZWFtPgp1c2luZyBuYW1lc3BhY2Ugc3RkOwoKYm9vbCBpc3ByaW1lKGludCB4KQp7CiAgICBmb3IgKGludCBpID0gMjsgaSAqIGkgPD0geDsgaSsrKQogICAgICAgIGlmICh4ICUgaSA9PSAwKQogICAgICAgICAgICByZXR1cm4gZmFsc2U7CiAgICByZXR1cm4gdHJ1ZTsKfQpib29sIGlzU3VtT2ZLcHJpbWVzKGludCBOLCBpbnQgSykKewogICAgaWYgKE4gPCAyKkspCiAgICAgICAgcmV0dXJuIGZhbHNlOwogICAgaWYgKEsgPT0gMSkKICAgICAgICByZXR1cm4gaXNwcmltZShOKTsKIAogICAgaWYgKEsgPT0gMikKICAgIHsKICAgICAgICBpZiAoTiAlIDIgPT0gMCkKICAgICAgICAgICAgcmV0dXJuIHRydWU7CiAgICAgICAgcmV0dXJuIGlzcHJpbWUoTiAtIDIpOwogICAgfQogICAgcmV0dXJuIHRydWU7Cn0KCnZvaWQgcHJpbnRSZXN1bHQoaW50IG4pewogICAgaW50IGFyclsyXVsyXSA9IHt7MTMsMn0sezcsNH19OwogICAgZm9yKGludCBpPTA7aTxuO2krKyl7CiAgICAgICAgaW50IHggPSBhcnJbaV1bMF0seSA9IGFycltpXVsxXTsKICAgICAgICBpZihpc1N1bU9mS3ByaW1lcyh4LHkpKWNvdXQ8PCJZRVNcbiI7CiAgICAgICAgZWxzZSBjb3V0PDwiTk9cbiI7CiAgICB9Cn0KCmludCBtYWluKCkgewoJLy8geW91ciBjb2RlIGdvZXMgaGVyZQoJcHJpbnRSZXN1bHQoMik7CglyZXR1cm4gMDsKfQ==