#include <iostream>
#include <iomanip>//小数点出力用
//cout << fixed << setprecision(10) << ans;
#include <cmath>
#include <algorithm>
#include <vector>
#include <queue>
#include <stack>
#include <set>
#include <map>
using ll = long long;
using namespace std;
#define modP 998244353
bool chkrng0idx(int pos, int sup) { return (0 <= pos && pos < sup); }
int clk4(int num) { return (num - 2) * (num % 2); }
void yn(bool tf) { cout << (tf ? "Yes\n" : "No\n"); }

int main() {
    ios::sync_with_stdio(false);
    cin.tie(nullptr);
    int N, D, K;
    cin >> N >> D >> K;
    ll A[1002], C[1002];
    for (int i = 0;i < N;i++)cin >> A[i];
    for (int i = 0;i < N;i++)cin >> C[i];
    ll dp[501][501];for (int j = 0;j <= K;j++)for (int k = 0;k <= D;k++)dp[j][k] = -1e18;
    dp[0][0] = 0;
    ll ndp[501][501];for (int j = 0;j <= K;j++)for (int k = 0;k <= D;k++)dp[j][k] = -1e18;
    for (int i = 1;i <= N;i++) {
        ll ndp[501][501];for (int j = 0;j <= K;j++)for (int k = 0;k <= D;k++)dp[j][k] = -1e18;
        for (int j = 0;j < K;j++) {
            for (int k = 1;k <= min(D, i);k++) {
                ndp[j][k] = dp[j][k];
                if (j - C[i] >= 0 && dp[j - C[i]][k - 1] != -1e18) {
                    ndp[j][k] = max(ndp[j][k], dp[j - C[i]][k - 1] + A[i]);
                }
            }
        }
        //j==K
        for (int k = 1;k <= min(D, i);k++) {
            ndp[K][k] = dp[K][k];
            for (int jj = K - C[i];jj <= K;jj++) {
                if (dp[jj][k - 1] != -1e18) {
                    ndp[K][k] = max(ndp[K][k], dp[jj][k - 1] + A[i]);
                }
            }
        }
        for (int j = 0;j <= K;j++)for (int k = 0;k <= D;k++)dp[j][k] = ndp[j][k];
    }
    if (dp[K][D] == -1e18)cout << "No";
    else cout << dp[K][D];
    return 0;
}