using System;
using System.Collections.Generic;
using System.Linq;

class Program
{
    static string ReadLine()
    { 
        return Console.ReadLine().Trim();
    }

    static void Main()
    {
        int N, D, K;
        {
            int[] vs = ReadLine().Split().Select(_ => int.Parse(_)).ToArray();
            N = vs[0];
            D = vs[1];
            K = vs[2];
        }

        int[] A = ReadLine().Split().Select(_ => int.Parse(_)).ToArray();
        int[] C = ReadLine().Split().Select(_ => int.Parse(_)).ToArray();

        long[,] dp = new long[D + 1, K + 1];
        for (int d = 0; d <= D; d++)
        {
            for (int k = 0; k <= K; k++)
                dp[d, k] = long.MinValue;
        }

        dp[0, 0] = 0;

        for (int i = 0; i < A.Length; i++)
        {
            long[,] nextdp = new long[D + 1, K + 1];
            for (int d = 0; d <= D; d++)
            {
                for (int k = 0; k <= K; k++)
                    nextdp[d, k] = long.MinValue;
            }

            for (int d = 0; d <= D; d++)
            {
                for (int k = 0; k <= K; k++)
                {
                    if (dp[d, k] == long.MinValue)
                        continue;

                    nextdp[d, k] = Math.Max(dp[d, k], nextdp[d, k]);
                    if(d >= D)
                        continue;

                    if (k + C[i] < K)
                        nextdp[d + 1, k + C[i]] = Math.Max(dp[d, k] + A[i], nextdp[d + 1, k + C[i]]);
                    else
                        nextdp[d + 1, K] = Math.Max(dp[d, k] + A[i], nextdp[d + 1, K]);
                }
            }
            dp = nextdp;
        }
        if(dp[D, K] > long.MinValue)
            Console.WriteLine(dp[D, K]);
        else
            Console.WriteLine("No");
    }
}