#include <bits/stdc++.h>
using namespace std;
vector<int64_t> prime;
void seive() {
  bitset<1200> mark;
  for (int64_t i = 4; i < 1200; i += 2) {
    mark[i] = 1;
  }
  for (int64_t i = 3; i < 1200; i += 2) {
    if (!mark[i]) {
      for (int64_t j = i * i; j < 1200; j += i) {
        mark[j] = 1;
      }
    }
  }
  for (int64_t i = 2; i < 1002; i++) {
    if (!mark[i]) {
      prime.push_back(i);
    }
  }
}
void solve() {
  seive();
  int64_t lowest, n, k, count = 0;
  int64_t sum = 0;
  cin >> n >> k;
  vector<int64_t> sumprime;
  lowest = lower_bound(prime.begin(), prime.end(), n) - prime.begin();
  for (int64_t i = 0; i < lowest; i++) {
    if (binary_search(prime.begin(), prime.end(),
                      prime[i] + prime[i + 1] + 1) &&
        (prime[i] + prime[i + 1] + 1) <= n) {
      count++;
    }
  }
  if (count >= k) {
    cout << "YES"
         << "\n";
  } else {
    cout << "NO"
         << "\n";
  }
}
int32_t main() {
  ios_base::sync_with_stdio(false);
  cin.tie(NULL);
  ;
  cout.precision(10);
  cout << fixed;
  ;
  { solve(); }
  return 0;
}
