/* -*- coding: utf-8 -*-
 *
 * 3014.cc:  No.3014 蟯ｩ莠墓ｺ€雜ｳ諤ｧ蝠城｡・- yukicoder
 */

#include<cstdio>
#include<algorithm>

using namespace std;

/* constant */

const int MAX_N = 500;
const int MAX_K = 500;
const long long LINF = 1LL << 62;

/* typedef */

using ll = long long;

/* global variables */

int as[MAX_N], cs[MAX_N];
ll dp[MAX_N + 1][MAX_K + 1];

/* subroutines */

inline void setmax(ll &a, ll b) { if (a < b) a = b; }

/* main */

int main() {
  int n, d, k;
  scanf("%d%d%d", &n, &d, &k);
  for (int i = 0; i < n; i++) scanf("%d", as + i);
  for (int i = 0; i < n; i++) scanf("%d", cs + i);

  for (int j = 0; j <= d; j++) fill(dp[j], dp[j] + k + 1, -LINF);
  dp[0][0] = 0;

  for (int i = 0; i < n; i++) {
    for (int j = min(i, d - 1); j >= 0; j--)
      for (int l = k; l >= 0; l--)
	if (dp[j][l] > -LINF)
	  setmax(dp[j + 1][min(l + cs[i], k)], dp[j][l] + as[i]);
  }

  if (dp[d][k] > -LINF) printf("%lld\n", dp[d][k]);
  else puts("No");
  
  return 0;
}