#include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)

void solve() {
  ll n, k;
  cin >> n >> k;
  vector<ll> cnt(n + 1, 0);
  rep(i, n) {
    ll a;
    cin >> a;
    cnt[a]++;
  }
  bool ok = false;
  rep(i, n) {
    if (cnt[0] + cnt[i + 1] >= k) {
      ok = true;
      break;
    }
  }
  cout << (ok ? "Yes" : "No") << '\n';
}

int main() {
  std::cin.tie(nullptr);
  std::ios_base::sync_with_stdio(false);
  int T = 1;
  for (int t = 0; t < T; t++) {
    solve();
  }
  return 0;
}