#include <bits/stdc++.h>
#include <atcoder/all>
using namespace std;
using namespace atcoder;

typedef long long ll;
typedef modint998244353 mint;
const int MOD = 1000000007;
#define all(x) x.begin(), x.end()
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
const int inf = 1 << 30;
const ll INF = 1LL << 60;
const int dx[8] = {1, 0, -1, 0, -1, -1, 1, 1};
const int dy[8] = {0, 1, 0, -1, -1, 1, -1, 1};
template <class T> bool chmax(T& a, const T& b) { if (a < b) { a = b; return 1; } return 0; }
template <class T> bool chmin(T& a, const T& b) { if (b < a) { a = b; return 1; } return 0; }

int main(){
    int n, m, l;
    cin >> n >> m >> l;
    vector<int> a(n);
    rep(i, n) cin >> a[i];

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

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

    return 0;
}