#include<iostream>
#include<string>
#include<queue>
#include<vector>
#include<cassert>
#include<random>
#include<set>
#include<map>
#include<cassert>
#include<unordered_map>
#include<bitset>
#include<numeric>
#include<algorithm>
using namespace std;
typedef long long ll;
const int inf=1<<30;
const ll INF=1LL<<62;
typedef pair<int,ll> P;
typedef pair<int,P> PP; 
const ll MOD=998244353;

bool dp[105][1000*100+5];

int main(){
    int N,M,L;
    cin>>N>>M>>L;
    vector<int> A(N);
    for(int i=0;i<N;i++){
        cin>>A[i];
    }

    const int MAX=1000*100;

    dp[0][L]=1;

    for(int i=0;i<N;i++){
        for(int c=0;c<=MAX;c++){
            if(dp[i][c]){
                int x=(c+A[i])/2;
                dp[i+1][x]=1;
                dp[i+1][c]=1;
            }
        }
    }

    if(dp[N][M]){
        cout<<"Yes"<<endl;
    }else{
        cout<<"No"<<endl;
    }
}