#include <bits/stdc++.h>
using namespace std;
const int dx[8] = {0, -1, 0, 1, -1, -1, 1, 1},
          dy[8] = {1, 0, -1, 0, -1, 1, -1, 1};
int pri[1005];
bool vis[1005], vis2[1005];
void prime() {
  pri[1] = 2;
  pri[0] = 1;
  for (int i = 3; i <= 1000; i++) {
    if (!vis[i]) {
      vis[i] = true;
      pri[++pri[0]] = i;
    }
    for (int j = 1; j <= pri[0] && pri[j] * i <= 1000; j++) {
      vis[pri[j] * i] = true;
      if (i % pri[j] == 0) break;
    }
  }
  for (int i = 3; i <= pri[0]; i++) {
    for (int j = i - 1; j >= 2; j--)
      if (pri[i] == pri[j] + pri[j - 1] + 1) {
        vis2[pri[i]] = true;
      }
  }
}
int main() {
  int n, m;
  cin >> n >> m;
  prime();
  int num = 0;
  for (int i = 2; i <= n; i++)
    if (vis2[i]) num++;
  if (num >= m)
    printf("Yes\n");
  else
    printf("No\n");
  return 0;
}
