#include <bits/stdc++.h>
using namespace std;
#include <atcoder/all>
using namespace atcoder;
#define ll long long
#define rep(i, n) for (ll i = 0; i < (ll)(n); i++)
using mint = modint998244353;
const int dx[4]={0,1,0,-1};
const int dy[4]={1,0,-1,0};

int n,k;
int main(){
    cin >> n >> k;
    vector<int> a(n);
    rep(i,n) cin >> a[i];
    map<int,int> mp;
    rep(i,n){
        mp[a[i]]++;
    }
    int kaeru_ok=mp[0];
    int dai=0;
    for(auto x:mp){
        if(x.first==0) continue;
        dai=max(dai,x.second);
    }
    if(dai+kaeru_ok>=k){
        cout << "Yes" << endl;
    }else{
        cout << "No" << endl;
    }
    return 0;
}