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[N + 1, D + 1, K + 1];
        for (int a = 0; a < dp.GetLength(0); a++)
        {
            for (int b = 0; b < dp.GetLength(1); b++)
            {
                for (int c = 0; c < dp.GetLength(2); c++)
                    dp[a, b, c] = long.MinValue;
            }
        }
        dp[0, 0, 0] = 0;

        for (int i = 0; i < A.Length; i++)
        {
            for (int b = 0; b < dp.GetLength(1); b++)
            {
                for (int c = 0; c < dp.GetLength(2); c++)
                {
                    if (dp[i, b, c] == long.MinValue)
                        continue;

                    dp[i + 1, b, c] = Math.Max(dp[i, b, c], dp[i + 1, b, c]);
                    if(b >= D)
                        continue;

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