#include using namespace std; using ll = long long; int main() { ll N, D, K; cin >> N >> D >> K; vector A(N), C(N); for (auto&& a : A) cin >> a; for (auto&& c : C) cin >> c; ll inf = -100000000000ll; // dp[i][j][k]:=i番目まで見てj個の問題案を採用したときに美しさがk vector dp(N + 1, vector(D + 1, vector(K + 1, inf))); dp[0][0][0] = 0; for (int i = 0; i < N; i++) { for (int j = 0; j <= D; j++) { for (int k = 0; k <= K; k++) if (dp[i][j][k] != inf) { dp[i + 1][j][k] = max(dp[i + 1][j][k], dp[i][j][k]); if (j != D) { auto& a = dp[i + 1][j + 1][min(K, k + C[i])]; a = max(a, dp[i][j][k] + A[i]); } } } } if (dp[N][D][K] == inf) { cout << "No\n"; } else { cout << dp[N][D][K] << endl; } }