#include #include // AtCoder using namespace std; using namespace atcoder; // AtCoder using uint = unsigned int; using ll = long long; using ull = unsigned long long; using ld = long double; using mint = modint998244353; // AtCoder using vll = vector; using vvll = vector>; using vvvll = vector>>; using vvvvll = vector>>>; using vbl = vector; using vvbl = vector>; using vvvbl = vector>>; using vvvvbl = vector>>>; using dll = deque; using ddll = deque>; using dddll = deque>>; using ddddll = deque>>>; using pll = pair; using vpll = vector>; using vvpll = vector>>; #define rep(i, n) for (long long i = 0; i < n; i++) #define reps(i, n) for (long long i = 1; i <= n; i++) #define rrep(i, n) for (long long i = n - 1; i >= 0; i--) #define rreps(i, n) for (long long i = n; i >= 1; i--) #define reep(i, a, b) for (long long i = a; i < b; i++) #define all(a) (a).begin(), (a).end() #define rall(a) (a).rbegin(), (a).rend() #define PI acos(-1.0) #define YesNo(flag) if(flag) { cout << "Yes" << endl; } else { cout << "No" << endl; } constexpr long long MOD = 998244353LL; constexpr long long INF = (1LL << 60); template void setcout(T n) {cout << setprecision(n) << fixed;} template void arrcout(T &a) { for(size_t i = 0; i < a.size(); i++) cout << (i ? " " : "") << a.at(i); cout << endl; } template void arrcout2(T &a) { for(size_t i = 0; i < a.size(); i++) { for(size_t j = 0; j < a[i].size(); j++) cout << (j ? " " : "") << a.at(i).at(j); cout << endl;} } template constexpr auto min(T... a){return min(initializer_list>{a...});} template constexpr auto max(T... a){return max(initializer_list>{a...});} template bool chmax(T& a, const T& b) { if (a < b) { a = b; return 1; } return 0; } template bool chmin(T& a, const T& b) { if (b < a) { a = b; return 1; } return 0; } //#pragma GCC target("avx2") //#pragma GCC optimize("O3") //#pragma GCC optimize("unroll-loops") int main() { ll n, m, l; cin >> n >> m >> l; vll a(n); rep(i, n) cin >> a[i]; vvll dp(n + 1, vll(2010)); dp[0][l] = true; rep(i, n) rep(j, 1010) { dp[i + 1][j] |= dp[i][j]; dp[i + 1][(j + a[i]) / 2] |= dp[i][j]; } bool flag = false; rep(i, n + 1) flag |= dp[i][m]; YesNo(flag); }