// UUID: af8649d5-8110-4d12-980e-e724f2f8429d
#include <bits/stdc++.h>
using namespace std;

void solve() {
    int n, m;
    cin >> n >> m;
    vector<pair<long long, long long>> tasks(n);

    for (int i = 0; i < n; i++) {
        long long a;
        cin >> a;
        
        tasks[i].second = a;
    }

    for (int i = 0; i < n; i++) {
        long long b;
        cin >> b;
        
        tasks[i].first = b;
    }

    vector<long long> dp(m + 1, 0);

    for (int curr = 1; curr <= m; curr++) {
        for (const auto& task : tasks) {
            if (task.second <= curr) {
                dp[curr] = max(dp[curr], dp[curr - task.second] + task.first);
            }
        }
    }

    cout << dp[m];
    return;
}

int main() {
    ios::sync_with_stdio(false);
    cin.tie(nullptr);
    int t = 1;
    //cin >> t;

    while (t--) {
        solve();
    }

    return 0;
}