#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using pll = pair<ll, ll>;
#define drep(i, cc, n) for (ll i = (cc); i <= (n); ++i)
#define rep(i, n) drep(i, 0, n - 1)
#define all(a) (a).begin(), (a).end()
#define pb push_back
#define fi first
#define se second

const ll MOD = 1000000007;
const ll MOD2 = 998244353;
const ll INF = 1LL << 60;
const ll MAX_N = 2e5;

int main(){
    ll n, m, l;
    cin >> n >> m >> l;

    vector<ll> a(n);
    rep(i, n) cin >> a[i];

    vector<vector<bool>> dp(n+1, vector<bool>(1001, false));
    dp[0][l]=true;
    for(ll i=1; i<=n; i++){
        for(ll j=0; j<=1000; j++){
            if(dp[i-1][j]){
                dp[i][j]=true;
                dp[i][(j+a[i-1])/2]=true;
            }
        }
    }

    if(dp[n][m]) cout << "Yes" << endl;
    else cout << "No" << endl;
}