//include std
#include <bits/stdc++.h>
using namespace std;
//コンパイラと浮動小数点高速化
//#pragma GCC optimize("Ofast")//危険かも
#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")
//cin,endlの高速化
struct Fast {Fast() {std::cin.tie(0); ios::sync_with_stdio(false);}} fast;
#define endl '\n'
//using
using ll=long long;
using vi=vector<int>;
using vl=vector<ll>;
using vvi=vector<vi>;
using vvl=vector<vl>;
//define
#define itn int//これすき

/*最終兵器
絶対使うな
#define int long long
 */

//マクロ
#define reps(i, a, n) for (ll i = (a); i < (ll)(n); ++i)
#define rep(i, n) reps(i, 0, n)
#define rrep(i, n) reps(i, 1, n + 1)
#define per(i,n) for(ll i=n-1;i>=0;i--)
#define pper(i,n) for(ll i=n;i>=1;i--)
#define all(x) (x).begin(),(x).end()
#define perm(c) sort(all(c));for(bool c##p=1;c##p;c##p=next_permutation(all(c)))
#define sz(x) ((int)(x).size())
#define YesNo(bool) if(bool){cout<<"Yes"<<endl;}else{cout<<"No"<<endl;}
#define vout(vi) rep(i,sz(vi))cout<<vi.at(i)<<" \n"[i+1==n];


int main() {
    int n,m,l;
    cin>>n>>m>>l;
    vi a(n);
    rep(i,n)cin>>a.at(i);
    vvi dp(n+1,vi(1001));
    dp.at(0).at(l)=1;
    rrep(i,n){
        rep(j,1001){
            if(dp.at(i-1).at(j)==1){
                dp.at(i).at(j)=1;
                dp.at(i).at((j+a.at(i-1))/2)=1;
            }
        }
    }
    if(dp.at(n).at(m)==1){
        cout<<"Yes";
        
    }
    else{
        cout<<"No";
    }
    cout<<endl;
}