#include <bits/stdc++.h>
using namespace std;
int n, k, cnt, ans, prime[1005], tot = 0;
int x[1005];
int v[1005];
void primes(int n) {
  memset(v, 0, sizeof(v));
  cnt = 0;
  for (int i = 2; i <= n; i++) {
    if (!v[i]) {
      v[i] = i;
      prime[++cnt] = i;
    }
    for (int j = 1; j <= cnt; j++) {
      if (prime[j] > v[i] || prime[j] > n / i) break;
      v[i * prime[j]] = prime[j];
    }
  }
}
int main() {
  memset(x, 0x3f3f3f, sizeof x);
  cin >> n >> k;
  primes(n);
  for (int i = 3; i <= cnt; ++i)
    for (int j = 1; j <= i - 2; ++j) {
      if (prime[j] + prime[j + 1] + 1 == prime[i]) x[++tot] = prime[i];
    }
  for (int i = 1; i <= tot + 1; ++i)
    if (x[i] > n) {
      ans = i - 1;
      break;
    }
  if (ans >= k)
    cout << "YES";
  else
    cout << "NO";
}
