#include<iostream>
#include<vector>
#include<algorithm>
#include<cstring>
#include<cassert>
#include<cmath>
#include<ctime>
#include<iomanip>
#include<numeric>
#include<stack>
#include<queue>
#include<map>
#include<unordered_map>
#include<set>
#include<unordered_set>
#include<bitset>
#include<random>
using namespace std;
int N,M,L;
int dp[2][1001];
void solve()
{
	cin >> N >> M >> L;
	int cur = 0;
	dp[cur][L] = 1;
	for(int i = 0;i < N;i++)
	{
		int A;
		cin >> A;
		int nxt = 1-cur;
		for(int j = 0;j <= 1000;j++) dp[nxt][j] = 0;
		for(int j = 0;j <= 1000;j++) if(dp[cur][j])
		{
			dp[nxt][j] = 1;
			dp[nxt][(j+A)/2] = 1;
		}
		cur = nxt;
	}

	cout << (dp[cur][M] ? "Yes":"No") << endl;
}
int main()
{
	ios::sync_with_stdio(false);
	cin.tie(nullptr);
	int tt = 1;
	//cin >> tt;
	while(tt--) solve();
}