#include <bits/stdc++.h>
using namespace std;
vector<int> prime;
int y;
int checker(int n) {
  for (int i = 0; i < y && i < n; i++) {
    if (prime[i] + prime[i + 1] + 1 == n) return 1;
    if (prime[i] + prime[i + 1] + 1 > n) return 0;
  }
}
int isprime(int n) {
  int x = sqrt(n);
  for (int i = 2; i <= x; i++) {
    if (n % i == 0) return 0;
  }
  return 1;
}
int main() {
  int n, k, counter = 0;
  cin >> n >> k;
  prime.push_back(2);
  prime.push_back(3);
  prime.push_back(5);
  y = 3;
  for (int i = 7; i <= n; i++) {
    if (isprime(i)) {
      prime.push_back(i);
      y++;
      if (checker(i)) counter++;
      if (counter >= k) break;
    }
  }
  if (counter >= k)
    cout << "YES" << endl;
  else
    cout << "NO" << endl;
  return 0;
}
