#include <bits/stdc++.h>
using namespace std;
int n, k;
double P[1000];
bool prime[1003];
bool compose[5000];
int main() {
  scanf("%d %d", &n, &k);
  for (int i = 3; i <= 1000; i++) {
    bool isPrime = true;
    for (int j = 2; j * j <= i; j++) {
      if (i % j == 0) {
        isPrime = false;
        break;
      }
    }
    if (isPrime) prime[i] = true;
  }
  int first = 2;
  for (int i = 3; i <= 1000; i++) {
    if (prime[i]) {
      compose[first + i + 1] = true;
      first = i;
    }
  }
  int res = 0;
  for (int i = 3; i <= n; i++) {
    if (compose[i] && prime[i]) res++;
  }
  if (res >= k) {
    printf("YES\n");
  } else {
    printf("NO\n");
  }
  return 0;
}
