#include <bits/stdc++.h>
using namespace std;
int main() {
  bool p[10001];
  for (int i = 0; i <= 10000; i++) p[i] = false;
  p[0] = true;
  p[1] = true;
  for (int i = 2; i <= 100; i += 2) {
    for (int j = i * i; j <= 10000; j += i) {
      p[j] = true;
    }
    if (i == 2) i--;
  }
  vector<int> prime;
  for (int i = 0; i <= 1000; i++) {
    if (p[i] == false) prime.push_back(i);
  }
  int siz = prime.size();
  int k, n, count = 0, sum;
  cin >> n >> k;
  bool flag = false;
  for (int i = 0; i < siz - 1; i++) {
    sum = prime[i] + prime[i + 1] + 1;
    if (sum > n) break;
    if (!p[sum]) {
      count++;
    }
  }
  if (count >= k)
    cout << "YES\n";
  else
    cout << "NO\n";
  return 0;
}
