#include<bits/stdc++.h>

using namespace std;

const int INF = 1 << 30;

int dp[51][52][52][4];
int N, L[50], W[50];

bool uku(int a, int b, int c) {
  if(a == b || a == c || b == c) return false;
  int s = min({a, b, c});
  int t = max({a, b, c});
  return (s == b || t == b);
}


int rec(int rest, int l1, int l2, int proc) {
  if(~dp[rest][l1][l2][proc]) return dp[rest][l1][l2][proc];
  int ret = proc <= 2 ? -INF : 0;
  for(int i = 0; i < N; i++) {
    if(rest - W[i] < 0) continue;
    if(uku(l1, l2, L[i])) ret = max(ret, rec(rest - W[i], l2, L[i], min(proc + 1, 3)) + L[i]);
  }
  return dp[rest][l1][l2][proc] = ret;
}

int main() {
  int K;
  cin >> N >> K;
  for(int i = 0; i < N; i++) cin >> L[i];
  for(int i = 0; i < N; i++) cin >> W[i];
  memset(dp, -1, sizeof(dp));
  int ret = 0;
  for(int i = 0; i <= 50; i++) {
    for(int j = 0; j <= 50; j++) {
      ret = max(ret, rec(K, i, j, 0));
    }
  }
  cout << ret << endl;
}