#include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define int ll
signed main() {
  int n, d, k; cin >> n >> d >> k;
  vector<int> a(n), c(n);
  for (int i = 0; i < n; i++) {
    cin >> a[i];
  }
  for (int i = 0; i < n; i++) {
    cin >> c[i];
  }
  vector<vector<vector<int>>> dp(n+1, vector<vector<int>>(d+1, vector<int>(k+1, -1)));
  dp[0][0][0] = 0;
  for (int i = 0; i < n; i++) {
    dp[i+1] = dp[i];
    for (int j = 0; j < d; j++) {
      for (int l = 0; l <= k; l++) {
        if (dp[i][j][l] == -1) continue;
        int t = min(k, l + c[i]);
        dp[i+1][j+1][t] = max(dp[i+1][j+1][t], dp[i][j][l] + a[i]);
      }
    }
  }
  if (dp[n][d][k] == -1) {
    cout << "No" << endl;
  }
  else {
    cout << dp[n][d][k] << endl;
  }
}