#include <bits/stdc++.h>
inline int zs(int a) {
  if (a < 2) return 0;
  for (register int i = 2; i * i <= a; i++) {
    if (a % i == 0) return 0;
  }
  return 1;
}
int f[1005], num, ans, n, k;
int main() {
  scanf("%d %d", &n, &k);
  for (register int i = 2; i <= n; i++) {
    if (zs(i)) f[++num] = i;
  }
  for (register int i = 1; i <= num; i++) {
    if (zs(f[i] + f[i + 1] + 1) && f[i] + f[i + 1] + 1 <= n) {
      ans++;
    }
  }
  if (ans >= k)
    printf("YES");
  else
    printf("NO");
}
