#include <bits/stdc++.h>
using namespace std;
using ll = long long;

int main() {
  ll N, D, K;
  cin >> N >> D >> K;
  vector<ll> 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(D + 1, vector<ll>(K + 1, inf));
  vector ndp(D + 1, vector<ll>(K + 1, inf));
  dp[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[j][k] != inf) {
          ndp[j][k] = max(ndp[j][k], dp[j][k]);
          if (j != D) {
            auto& a = ndp[j + 1][min(K, k + C[i])];
            a = max(a, dp[j][k] + A[i]);
          }
        }
    }
    swap(dp, ndp);
    for (int i = 0; i <= D; i++)
      for (int j = 0; j <= K; j++) ndp[i][j] = inf;
  }
  if (dp[D][K] == inf) {
    cout << "No\n";
  } else {
    cout << dp[D][K] << endl;
  }
}