using System;
using System.IO;
using System.Collections.Generic;
using System.Globalization;
using System.Linq;
using System.Text;


partial class Solver
{
    static public void UpdateMax<T>(ref T x, T newValue) where T : IComparable<T>
    {
        if (x.CompareTo(newValue) < 0) x = newValue;
    }


    public void Run()
    {
        var N = ni();
        var C = ni();
        var L = ni(N);
        var W = ni(N);

        var dp = new int[51, 51, C + 1]; // prevNum2, prevNum, cost

        for (int i = 0; i < N; i++)
        {
            for (int j = 0; j < N; j++)
            {
                for (int k = 0; k < N; k++)
                {
                    if (W[i] + W[j] + W[k] <= C && L[i] != L[j] && L[i] != L[k] && L[j] != L[k] &&
                        ((L[i] > L[j] && L[j] < L[k]) || (L[i] < L[j] && L[j] > L[k])))
                    {
                        UpdateMax(ref dp[L[j], L[k], W[i] + W[j] + W[k]], L[i] + L[j] + L[k]);
                    }
                }
            }
        }

        for (int c = 0; c <= C; c++)
        {
            for (int prevNum2 = 0; prevNum2 < 51; prevNum2++)
            {
                for (int prevNum = 0; prevNum < 51; prevNum++)
                {
                    if (dp[prevNum2, prevNum, c] == 0) continue;
                    for (int i = 0; i < N; i++)
                    {
                        if (prevNum == L[i]) continue;
                        if (prevNum2 == L[i]) continue;
                        if (prevNum2 > prevNum && prevNum >= L[i]) continue;
                        if (prevNum2 < prevNum && prevNum <= L[i]) continue;
                        if (c + W[i] > C) continue;
                        UpdateMax(ref dp[prevNum, L[i], c + W[i]], dp[prevNum2, prevNum, c] + L[i]);
                    }
                }
            }
        }

        cout.WriteLine(dp.Cast<int>().Max());
    }
}

// PREWRITEN CODE BEGINS FROM HERE
partial class Solver : Scanner
{
    public static void Main(string[] args)
    {
        new Solver(Console.In, Console.Out).Run();
    }

    TextReader cin;
    TextWriter cout;

    public Solver(TextReader reader, TextWriter writer)
        : base(reader)
    {
        this.cin = reader;
        this.cout = writer;
    }
    public Solver(string input, TextWriter writer)
        : this(new StringReader(input), writer)
    {
    }

    public int ni() { return NextInt(); }
    public int[] ni(int n) { return NextIntArray(n); }
    public long nl() { return NextLong(); }
    public long[] nl(int n) { return NextLongArray(n); }
    public double nd() { return NextDouble(); }
    public string ns() { return Next(); }
    public string[] ns(int n) { return NextArray(n); }
}

public class Scanner
{
    private TextReader Reader;
    private Queue<String> TokenQueue = new Queue<string>();
    private CultureInfo ci = CultureInfo.InvariantCulture;

    public Scanner()
        : this(Console.In)
    {
    }

    public Scanner(TextReader reader)
    {
        this.Reader = reader;
    }

    public int NextInt() { return Int32.Parse(Next(), ci); }
    public long NextLong() { return Int64.Parse(Next(), ci); }
    public double NextDouble() { return double.Parse(Next(), ci); }
    public string[] NextArray(int size)
    {
        var array = new string[size];
        for (int i = 0; i < size; i++) array[i] = Next();
        return array;
    }
    public int[] NextIntArray(int size)
    {
        var array = new int[size];
        for (int i = 0; i < size; i++) array[i] = NextInt();
        return array;
    }

    public long[] NextLongArray(int size)
    {
        var array = new long[size];
        for (int i = 0; i < size; i++) array[i] = NextLong();
        return array;
    }

    public String Next()
    {
        if (TokenQueue.Count == 0)
        {
            if (!StockTokens()) throw new InvalidOperationException();
        }
        return TokenQueue.Dequeue();
    }

    public bool HasNext()
    {
        if (TokenQueue.Count > 0)
            return true;
        return StockTokens();
    }

    private bool StockTokens()
    {
        while (true)
        {
            var line = Reader.ReadLine();
            if (line == null) return false;
            var tokens = line.Trim().Split(" ".ToCharArray(), StringSplitOptions.RemoveEmptyEntries);
            if (tokens.Length == 0) continue;
            foreach (var token in tokens)
                TokenQueue.Enqueue(token);
            return true;
        }
    }
}