import std;

void main () {
    int N, D, K; readln.read(N, D, K);
    auto A = readln.split.to!(int[]);
    auto C = readln.split.to!(int[]);

    auto dp = new long[][](D + 1, K + 1);
    auto ndp = new long[][](D + 1, K + 1);

    foreach (d; dp) d[] = -long.max;
    dp[0][0] = 0;

    foreach (i; 0 .. N) {
        foreach (d; ndp) d[] = -long.max;

        foreach (j; 0 .. D + 1) {
            foreach (k; 0 .. K + 1) {
                if (dp[j][k] == -long.max) continue;

                // とらない
                ndp[j][k] = max(ndp[j][k], dp[j][k]);

                // とる
                if (j + 1 <= D) {
                    ndp[j + 1][min(K, k + C[i])] = max(ndp[j + 1][min(K, k + C[i])], dp[j][k] + A[i]);
                }
            }
        }

        swap(dp, ndp);
    }

    if (dp[D][K] == -long.max) {
        writeln("No");
    }
    else {
        writeln(dp[D][K]);
    }
}

void read (T...) (string S, ref T args) {
    import std.conv : to;
    import std.array : split;
    auto buf = S.split;
    foreach (i, ref arg; args) {
        arg = buf[i].to!(typeof(arg));
    }
}