#include <bits/stdc++.h>
using namespace std;
inline void inp() {}
inline int inp(bool& A) {
  if (cin >> A) return 1;
  return -1;
}
inline int inp(char& A) { return scanf(" %c", &A); }
inline int inp(int& A) { return scanf("%d", &A); }
inline int inp(float& A) {
  if (cin >> A) return 1;
  return -1;
}
inline int inp(long long& A) { return scanf("%I64d", &A); }
inline int inp(double& A) { return scanf("%lf", &A); }
inline int inp(char* A) { return scanf("%s", A); }
inline int inp(string& A) {
  if (cin >> A) return 1;
  return -1;
}
template <class Front, class... Queue>
inline void inp(Front& A, Queue&... B) {
  inp(A);
  inp(B...);
}
inline void oup() {}
inline int oup(bool A) {
  if (cout << A) return 1;
  return -1;
}
inline int oup(char A) { return printf("%c", A); }
inline int oup(int A) { return printf("%d", A); }
inline int oup(float A) {
  if (cout << A) return 1;
  return -1;
}
inline int oup(long long A) { return printf("%I64d", A); }
inline int oup(double A) { return printf("%lf", A); }
inline int oup(char* A) { return printf(A); }
inline int oup(const char* A) { return printf("%s", A); }
inline int oup(string& A) {
  if (cout << A) return 1;
  return -1;
}
template <class Front, class... Queue>
inline void oup(Front A, Queue... B) {
  oup(A);
  oup(B...);
}
template <class T>
inline void remax(T& A, T B) {
  if (A < B) A = B;
}
template <class T>
inline void remin(T& A, T B) {
  if (A > B) A = B;
}
string ToString(long long num) {
  string ret;
  do {
    ret += ((num % 10) + '0');
    num /= 10;
  } while (num);
  reverse(ret.begin(), ret.end());
  return ret;
}
long long ToNumber(string s) {
  long long r = 0, p = 1;
  for (int i = s.size() - 1; i >= 0; --i) r += (s[i] - '0') * p, p *= 10;
  return r;
}
long long Gcd(long long a, long long b) {
  while (a %= b ^= a ^= b ^= a)
    ;
  return b;
}
long long Power(long long base, long long power) {
  long long ret = 1;
  while (power) {
    if (power & 1) ret *= base;
    power >>= 1;
    base *= base;
  }
  return ret;
}
int Log(long long num, long long base) {
  int ret = 0;
  while (num) {
    ++ret;
    num /= base;
  }
  return ret;
}
int Count(long long mask) {
  int ret = 0;
  while (mask) {
    if (mask & 1) ++ret;
    mask >>= 1;
  }
  return ret;
}
bool NotPrimeAndNoldpach[1001];
bool Noldpach(vector<int>& Primes, int Prime, int sz) {
  for (int i = 1; i < sz; ++i)
    if (Primes[i] + Primes[i - 1] + 1 == Prime) return true;
  return false;
}
void sieve() {
  vector<int> Primes;
  int sz = 0;
  NotPrimeAndNoldpach[0] = NotPrimeAndNoldpach[1] = true;
  for (int i = 2; i <= 1000; i += 2) NotPrimeAndNoldpach[i] = true;
  for (int i = 3; i <= 31; ++i)
    if (!NotPrimeAndNoldpach[i]) {
      for (int ii = i * i; ii < 1000; ii += i * 2)
        NotPrimeAndNoldpach[ii] = true;
      if (!Noldpach(Primes, i, sz)) NotPrimeAndNoldpach[i] = true;
      Primes.emplace_back(i);
      ++sz;
    }
  for (int i = 37; i <= 997; i += 2)
    if (!NotPrimeAndNoldpach[i]) {
      if (!Noldpach(Primes, i, sz)) NotPrimeAndNoldpach[i] = true;
      Primes.emplace_back(i);
      ++sz;
    }
}
void run() {
  sieve();
  int n, k;
  while (inp(n) == 1) {
    inp(k);
    for (int i = 3; i <= n; i += 2) {
      if (!k) {
        oup("YES\n");
        return;
      }
      if (!NotPrimeAndNoldpach[i]) --k;
    }
    oup(k ? "NO\n" : "YES\n");
  }
}
int main() {
  run();
  return 0;
}
