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