#include<bits/stdc++.h>
using namespace std;
using ll = long long;
#define rep(i,m,n) for(int i=m; i<n; ++i)
#define repll(i,m,n) for(ll i=m; i<n; ++i)
// #define rep(i,m,n) for(ll i=m; i<n; ++i)
#define all(a) (a).begin(), (a).end()
#define rall(a) (a).rbegin(), (a).rend()
#define fir first
#define sec second

template<typename T> bool chmin(T& a, T b){
    if(a > b){a = b; return true;}
    return false;
}
template<typename T> bool chmax(T& a, T b){
    if(a < b){a = b; return true;}
    return false;
}

int main(){
    int N, K;
    cin >> N >> K;
    vector<int> A(N);
    rep(i, 0, N) cin >> A[i];

    map<int, int> mp;
    rep(i, 0, N) mp[A[i]]++;

    if(mp[0] >= K){
        puts("Yes");
        return 0;
    }

    int max_num = -1;
    for(auto m : mp){
        if(m.fir == 0) continue;
        chmax(max_num, m.sec);
    }

    if(max_num + mp[0] >= K){
        puts("Yes");
    }else{
        puts("No");
    }
    return 0;
}