#include <bits/stdc++.h>
using namespace std;
long long int exp(long long int x, long long int y) {
  if (y == 0) return 1;
  if (y == 1) return x;
  if (y % 2 == 0)
    return exp(x, y / 2) * exp(x, y / 2);
  else
    return x * exp(x, y / 2) * exp(x, y / 2);
}
long long int gcd(long long int a, long long int b) {
  if (b == 0) return a;
  return gcd(b, a % b);
}
long long int lcm(long long int a, long long int b) {
  return (a * b) / gcd(a, b);
}
int l;
long long int fact(long long int x) {
  if (x == 1)
    return 1;
  else
    return x * fact(x - 1);
}
bool isPrime(int x) {
  int ans = 0;
  for (int i = 2; i <= sqrt(x); ++i) {
    if (x % i == 0) {
      ans = 1;
      i = x;
    }
  }
  return (!ans);
}
void solve() {
  int n, k;
  cin >> n >> k;
  int count = 0;
  vector<int> v;
  v.push_back(2);
  v.push_back(3);
  for (int i = 4; i <= n; ++i) {
    if (isPrime(i)) v.push_back(i);
  }
  for (int i = 0; i < v.size() - 1; ++i) {
    for (int j = i + 2; j < v.size(); ++j) {
      if (v[i] + v[i + 1] + 1 == v[j]) {
        count++;
      }
    }
  }
  if (count >= k)
    cout << "YES";
  else
    cout << "NO";
}
int main() {
  ios_base::sync_with_stdio(false);
  cin.tie(0);
  cout.tie(0);
  solve();
}
