// UUID: 925bcc3a-236b-47bc-9cb4-eea289bb2aff
#include <bits/stdc++.h>
using namespace std;

void solve() {
    int n, m;
    cin >> n >> m;

    vector<int> cost(n);
    vector<int> reward(n);

    for (int i = 0; i < n; i++) {
        cin >> cost[i];
    }

    for (int i = 0; i < n; i++) {
        cin >> reward[i];
    }

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

    for (int size = 1; size <= m; size++) {
        for (int task = 0; task < n; task++) {
            if (cost[task] <= size) {
                dp[size] = max(dp[size], dp[size - cost[task]] + reward[task]);
            }
        }
    }

    cout << dp[m];
    return;
}

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

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

    return 0;
}