#include <iostream>
#include <vector>
#include <cmath>
#include <map>
#include <set>
#include <iomanip>
#include <queue>
#include <algorithm>
#include <numeric>
#include <deque>
#include <complex>
#include <cassert>

using namespace std;
using ll = long long;

int main(){

    int N, M, L, A;
    cin >> N >> M >> L;
    deque<bool> dp(1001);
    dp[L] = 1;

    for (int i=0; i<N; i++){
        cin >> A;
        deque<bool> pd(1001);
        for (int j=0; j<=1000; j++){
            if (dp[j]){
                pd[j] = 1;
                pd[(A+j)/2] = 1;
            }
        }
        swap(pd, dp);
    }

    cout << (dp[M] ? "Yes" : "No") << endl;

    return 0;
}