/* -*- coding: utf-8 -*-
 *
 * 2155.cc:  No.2155 みちらcolor - yukicoder
 */

#include<cstdio>
#include<bitset>
#include<algorithm>
 
using namespace std;

/* constant */

const int MAX_N = 100;
const int MAX_A = 1000;

/* typedef */

typedef bitset<MAX_A+1> btst;

/* global variables */

int as[MAX_N];
btst dp[MAX_N + 1];

/* subroutines */

/* main */

int main() {
  int n, m, l;
  scanf("%d%d%d", &n, &m, &l);
  for (int i = 0; i < n; i++) scanf("%d", as + i);

  dp[0][l] = true;
  for (int i = 0; i < n; i++) {
    dp[i + 1] = dp[i];
    for (int j = 1; j <= MAX_A; j++)
      if (dp[i][j])
	dp[i + 1][(j + as[i]) / 2] = true;
  }

  if (dp[n][m]) puts("Yes");
  else puts("No");

  return 0;
}