#include <bits/stdc++.h>

using namespace std;
using ll = long long;
using ld = long double;

using Pair = pair<int, int>;
using Tuple = tuple<int, int, int>;
using VI1 = vector<int>;
using VI2 = vector<VI1>;
using VL1 = vector<ll>;
using VL2 = vector<VL1>;
using VD1 = vector<ld>;
using VD2 = vector<VD1>;
using VB1 = vector<bool>;
using VB2 = vector<VB1>;
using VP1 = vector<Pair>;
using VP2 = vector<VP1>;
using VT1 = vector<Tuple>;
using VT2 = vector<VT1>;

using Queue = queue<int>;
using DQ = deque<int>;
using PQ = priority_queue<int, vector<int>, greater<int>>;
using Table = VI2;
using Graph = VI2;

template <typename T>
bool chmin(T &a, T b) {
  if (a > b) {
    a = b;
    return true;
  }
  return false;
}

template <typename T>
bool chmax(T &a, T b) {
  if (a < b) {
    a = b;
    return true;
  }
  return false;
}

auto solve() {
  int N, M, L;
  cin >> N >> M >> L;
  VI1 A(N);
  for (auto &Ai : A) cin >> Ai;
  auto K = max({M, L, *max_element(A.begin(), A.end())});
  Table dp(N + 1, VI1(K + 1, 0));
  dp[0][L] = 1;
  for (int i = 0; i < N; ++i) {
    auto Ai = A.at(i);
    for (int j = 0; j <= K; ++j) {
      chmax(dp[i + 1][j], dp[i][j]);
      auto k = (Ai + j) / 2;
      chmax(dp[i + 1][k], dp[i][j]);
    }
  }
  return (dp[N][M] == 1);
}

void outputYesNo(bool yes, const string &Yes = "Yes", const string &No = "No") {
  if (yes)
    cout << Yes << '\n';
  else
    cout << No << '\n';
}

int main() {
  std::ios::sync_with_stdio(false);
  std::cin.tie(nullptr);
  auto result = solve();
  outputYesNo(result);
}