#include <bits/stdc++.h>
template <typename T>
T inline SQR(const T& a) {
  return a * a;
}
template <typename T>
T inline ABS(const T& a) {
  return a < 0 ? -a : a;
}
template <typename T>
T inline MIN(const T& a, const T& b) {
  if (a < b) return a;
  return b;
}
template <typename T>
T inline MAX(const T& a, const T& b) {
  if (a > b) return a;
  return b;
}
const double EPS = 1e-9;
inline int SGN(double a) {
  return ((a > EPS) ? (1) : ((a < -EPS) ? (-1) : (0)));
}
inline int CMP(double a, double b) { return SGN(a - b); }
using namespace std;
bool isPrime(int n) {
  for (int i = 2; i * i <= n; i++)
    if (n % i == 0) return false;
  return true;
}
int main(int argc, char* argv[]) {
  ios::sync_with_stdio(false);
  int n, k;
  cin >> n >> k;
  vector<int> prime;
  for (int cur = 2; k && (cur <= n); cur++) {
    if (isPrime(cur)) {
      for (size_t i = 0; i + 1 < prime.size(); i++)
        if (prime[i] + prime[i + 1] + 1 == cur) {
          k--;
          break;
        }
      prime.push_back(cur);
    }
  }
  if (k == 0)
    cout << "YES\n";
  else
    cout << "NO\n";
  return 0;
}
