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

class Program
{
    static int NN => int.Parse(ReadLine());
    static int[] NList => ReadLine().Split().Select(int.Parse).ToArray();
    static int[][] NArr(long n) => Enumerable.Repeat(0, (int)n).Select(_ => NList).ToArray();
    public static void Main()
    {
        Solve();
    }
    static void Solve()
    {
        var c = NList;
        var (n, k) = (c[0], c[1]);
        var l = NList;
        var w = NList;
        var dp = new int[n, n, k + 1];
        var INF = int.MinValue / 2;
        for (var x = 0; x < n; ++x) for (var y = 0; y < n; ++y) for (var p = 0; p <= k; ++p) dp[x, y, p] = INF;
        var flg = false;
        for (var x = 0; x < n; ++x) for (var y = 0; y < n; ++y) for (var z = 0; z < n; ++z)
        {
            if (l[x] != l[z] && ((l[x] < l[y] && l[y] > l[z]) || (l[x] > l[y] && l[y] < l[z])) && w[x] + w[y] + w[z] <= k)
            {
                dp[y, z, w[x] + w[y] + w[z]] = Math.Max(dp[y, z, w[x] + w[y] + w[z]], l[x] + l[y] + l[z]);
                flg = true;
            }
        }
        if (!flg)
        {
            WriteLine(0);
            return;
        }
        for (var p = 3; p < k; ++p)
        {
            for (var x = 0; x < n; ++x) for (var y = 0; y < n; ++y)
            {
                if (dp[x, y, p] == INF) continue;
                for (var z = 0; z < n; ++z)
                {
                    if (l[x] != l[z] && ((l[x] < l[y] && l[y] > l[z]) || (l[x] > l[y] && l[y] < l[z])) && p + w[z] <= k)
                    {
                        dp[y, z, p + w[z]] = Math.Max(dp[y, z, p + w[z]], dp[x, y, p] + l[z]);
                    }
                }
            }
        }
        var ans = 0;
        for (var x = 0; x < n; ++x) for (var y = 0; y < n; ++y) for (var p = 3; p <= k; ++p) ans = Math.Max(ans, dp[x, y, p]);
        WriteLine(ans);
    }
}