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

int main(){
    int n,m,l;
    cin >> n >> m >> l;
    vector<int> a(n);
    rep(i,n) cin >> a[i];
    vector<int> seen(1001);
    priority_queue<pair<int,int>,vector<pair<int,int>>,greater<pair<int,int>>> pq;
    pq.emplace(0,l);
    while(!pq.empty()){
        auto [v,col] = pq.top();
        pq.pop();
        if(seen[col] == 1) continue;
        seen[col] = 1;
        for(int i = v+1;i < n;i++){
            int nxt = (col+a[i])/2;
            if(seen[nxt]) continue;
            pq.emplace(i,nxt);
        }
    }
    if(seen[m]) cout << "Yes" << endl;
    else cout << "No" << endl;
}