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