#include <bits/stdc++.h>
using namespace std;
const int maxn = 1e3;
int n, k, db;
vector<int> pr;
set<int> s;
bool p[maxn + 1];
void solve() {
  cin >> n >> k;
  for (int i = 2; i <= maxn; ++i) {
    if (p[i]) continue;
    pr.push_back(i);
    s.insert(i);
    for (int j = 2 * i; j <= maxn; j += i) {
      p[j] = true;
    }
  }
  for (int i = 2; i <= n; ++i) {
    if (!s.count(i)) continue;
    bool van = false;
    for (int j = 0; j < pr.size() - 1; ++j) {
      if (pr[j] + pr[j + 1] + 1 == i) {
        van = true;
      }
    }
    if (van) ++db;
  }
  if (db < k) {
    cout << "NO\n";
  } else {
    cout << "YES\n";
  }
}
int main() {
  solve();
  return 0;
}
