#include <bits/stdc++.h>
using namespace std;
vector<int> prime;
bool isprime(int n) {
  for (int i = 2; i * i <= n; i++)
    if (n % i == 0) return false;
  return true;
}
int main() {
  int i, j, n, k, cnt = 0, pp = 2;
  cin >> n >> k;
  for (i = 2; i <= n; i++) {
    if (isprime(i)) prime.push_back(i);
  }
  for (i = 0; i < prime.size(); i++) {
    pp = prime[i] - 1;
    for (j = 0; j < prime.size(); j++) {
      if (prime[j] + prime[j + 1] == pp) {
        cnt++;
        break;
      } else if (prime[j] + prime[j + 1] > pp)
        break;
    }
  }
  if (cnt >= k)
    cout << "YES";
  else
    cout << "NO";
  return 0;
}
