#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
typedef vector<int> VI;
typedef vector<VI> VVI;
typedef vector<long long> VL;
typedef vector<VL> VVL;
typedef long long LL;
#define all(a) (a).begin(), (a).end()
#define Yes(n) cout << ((n) ? "Yes" : "No"  ) << endl
#define ALL(a)  (a).begin(),(a).end()
#define pb push_back

LL dp[502][502][502];
bool K[502][502][502];

void kou(int i,int j,int k,LL x){
  if(K[i][j][k]==0){
    K[i][j][k]=1; dp[i][j][k]=x;
  }
  else{
    dp[i][j][k]=max(dp[i][j][k],x);
  }
}

int main() {
  int n,d,k;
  cin>>n>>d>>k;
  dp[n][k][d]=-1;
  int A[n],C[n];
  rep(i,n){cin>>A[i];}
  rep(i,n){cin>>C[i];}
  K[0][0][0]=1;
  rep(i,n){
    int ii=min(i,d);
    rep(j,k+1)rep(l,ii+1){
      if(K[i][j][l]){kou(i+1,j,l,dp[i][j][l]);kou(i+1,min(k,j+C[i]),l+1,dp[i][j][l]+A[i]);}
    }
  }
  if(K[n][k][d]==0){
    cout<<"NO"<<endl;return 0;
  }
  cout<<dp[n][k][d]<<endl;
}