using System;
using static System.Console;
using System.Linq;
using System.Collections.Generic;

class Program
{
    static int NN => int.Parse(ReadLine());
    static long[] NList => ReadLine().Split().Select(long.Parse).ToArray();
    public static void Main()
    {
        Solve();
    }
    static void Solve()
    {
        var c = NList;
        var (n, m, w) = (c[0], (int)c[1], c[2]);
        var a = NList;
        var b = NList;
        c = NList;
        Array.Sort(a, (l, r) => r.CompareTo(l));
        var cum = new long[n + 1];
        for (var i = 0; i < n; ++i) cum[i + 1] = cum[i] + a[i];
        var bitmax = 1 << m;
        var ans = 0L;
        for (var p = 0; p < bitmax; ++p)
        {
            var tmp = p;
            var weight = 0L;
            var value = 0L;
            for (var i = 0; i < m; ++i)
            {
                if (tmp % 2 == 1)
                {
                    weight += b[i];
                    value += c[i];
                }
                tmp >>= 1;
            }
            if (weight <= w) ans = Math.Max(ans, value + cum[Math.Min(n, w - weight)]);
        }
        WriteLine(ans);
    }
}