from typing import Sequence


INF = 1 << 60


def solve(N: int, W: int, k: int, a: Sequence[int]) -> bool:
    dp = [[INF for _ in range(W)] for _ in range(N)]
    dp[0][0] = 0
    for i in range(N):
        for j in range(W + 1):
            if j == 0:
                dp[i + 1][j] = 0
            dp[i + 1][j] = min(dp[i + 1][j], dp[i][j])
            if j - a[i] >= 0:
                dp[i + 1][j] = min(dp[i + 1][j], 1 + dp[i][j - a[i]])
    return dp[N][W] <= k


n, w, k = map(int, input().split())
a = list(map(int, input().split()))
print("Yes" if solve(n, w, k, a) else "No")
