#include <bits/stdc++.h>
using namespace std;
void sieve(long long a[], long long n) {
  a[0] = a[1] = 0;
  for (long long i = 2; i * i <= n; i++) {
    if (a[i] == 1) {
      for (long long j = i * i; j <= n; j += i) {
        a[j] = 0;
      }
    }
  }
}
int main() {
  ios_base::sync_with_stdio(0);
  long long t;
  t = 1;
  while (t--) {
    long long n, k, cnt = 0;
    cin >> n >> k;
    long long a[n + 1];
    fill(a, a + n + 1, 1);
    sieve(a, n);
    vector<long long> b;
    for (int i = 0; i <= n; ++i)
      if (a[i] == 1) b.push_back(i);
    for (int i = 0; i < b.size() - 1; ++i)
      if (b[i] + b[i + 1] + 1 <= n && a[b[i] + b[i + 1] + 1] == 1) cnt++;
    if (cnt >= k)
      cout << "YES" << endl;
    else
      cout << "NO" << endl;
  }
  return 0;
}
