#include <iostream>
#include <algorithm>
#include <atcoder/all>
#include <cassert>
using namespace std;
using namespace atcoder;
using ll = long long;
const long long INF = 1000000000000000000;

int main(){
  ll N, D, K;
  cin >> N >> D >> K;
  assert(1 <= N && N <= 500);
  assert(1 <= D && D <= 500 && D <= N);
  assert(1 <= K && K <= 500);
  vector<ll> A(N + 1, 0), C(N + 1, 0);
  for(int i = 1; i <= N; i++){
    cin >> A[i];
    assert(-1e9 <= A[i] && A[i] <= 1e9);
  }
  for(int i = 1; i <= N; i++){
    cin >> C[i];
    assert(0 <= C[i] && C[i] <= 1e9);
  }
  vector<vector<ll>> dp(D + 1, vector<ll>(K + 1, -INF));
  dp[0][0] = 0;
  for(int i = 1; i <= N; i++){
    vector<vector<ll>> nexdp(D + 1, vector<ll>(K + 1, -INF));
    for(int j = 0; j <= D; j++){
      for(int k = 0; k <= K; k++){
        if(dp[j][k] == -INF) continue;
        //採用する
        if(j + 1 <= D) nexdp[j + 1][min(K, k + C[i])] = max(nexdp[j + 1][min(K, k + C[i])], dp[j][k] + A[i]);
        //採用しない
        nexdp[j][k] = max(nexdp[j][k], dp[j][k]);
      }
    }
    swap(dp, nexdp);
  }
  if(dp[D][K] == -INF) cout << "No" << endl;
  else cout << dp[D][K] << endl;
  return 0;
}