#define rep(i,n) for(int i=0;i<(int)(n);i++)
#define ALL(v) v.begin(),v.end()
typedef long long ll;

#include<bits/stdc++.h>
using namespace std;
template<class T>using V=vector<T>;
template<class T>using VV=V<V<T>>;

const ll INF=1e18;

int main(){
  ios::sync_with_stdio(false);
  std::cin.tie(nullptr);
  
  ll n,d,k;
  cin>>n>>d>>k;
  V<ll> A(n),C(n);
  rep(i,n) cin>>A[i];
  rep(i,n) cin>>C[i];
  
  VV<ll> dp(n+1,V<ll>(k+1,-INF));
  dp[0][0]=0;
  rep(i,n){
    VV<ll> old(n+1,V<ll>(k+1,-INF));
    swap(dp,old);
    rep(j,i+1){
      rep(l,k+1){
        if(old[j][l]==-INF) continue;
        dp[j][l]=max(dp[j][l],old[j][l]);
        ll nc=min(k,l+C[i]);
        dp[j+1][nc]=max(dp[j+1][nc],old[j][l]+A[i]);
      }
    }
  }
  if(dp[d][k]==-INF) cout<<"No"<<endl;
  else cout<<dp[d][k]<<endl;

  return 0;
}