#include <bits/stdc++.h>
using namespace std;
#ifdef LOCAL
  #include "settings/debug.cpp"
#else
  #define Debug(...) void(0)
#endif
#define rep(i, n) for (int i = 0; i < (n); ++i)
using ll = long long;
using ull = unsigned long long;

int main() {
  int n, d, k;
  cin >> n >> d >> k;
  vector<ll> a(n), c(n);
  rep(i, n) cin >> a[i];
  rep(i, n) cin >> c[i];
  constexpr ll INF = 1e18;
  vector dp(n + 1, vector(d + 1, vector<ll>(k + 1, -INF)));
  dp[0][0][0] = 0;
  rep(i, n) rep(j, min(d, i) + 1) rep(l, k + 1) {
    if (dp[i][j][l] == -INF) continue;
    dp[i + 1][j][l] = max(dp[i + 1][j][l], dp[i][j][l]);
    if (j < d) {
      dp[i + 1][j + 1][min((ll) k, l + c[i])] = max(dp[i + 1][j + 1][min((ll) k, l + c[i])], dp[i][j][l] + a[i]);
    }
  }
  if (dp[n][d][k] == -INF) {
    cout << "No" << '\n';
  }
  else {
    cout << dp[n][d][k] << '\n';
  }
  return 0;
}