#include <bits/stdc++.h>
using namespace std;
const int N = 2222;
int prime[N], pre[N];
bool pri(int num) {
  for (int i = 2; i * i <= num; i++)
    if (num % i == 0) return false;
  return true;
}
void init() {
  int i, j, cnt;
  for (i = 2; i <= 1000; i++) {
    if (!prime[i])
      for (j = i + i; j <= 1000; j += i) prime[j] = 1;
  }
  cnt = 0;
  for (i = 2; i <= 1000; i++) {
    if (!prime[i]) prime[++cnt] = i;
  }
  for (i = 2; i <= cnt; i++) {
    int t = prime[i] + prime[i - 1] + 1;
    if (pri(t)) pre[t] = 1;
  }
  for (i = 1; i <= 1000; i++) {
    pre[i] += pre[i - 1];
  }
}
int main() {
  init();
  int n, k;
  while (scanf("%d%d", &n, &k) != EOF) {
    if (pre[n] >= k)
      printf("YES\n");
    else
      printf("NO\n");
  }
  return 0;
}
