// UUID: 7fb7acef-9a42-452c-b4ba-0e769d8be30e
#include <bits/stdc++.h>
using namespace std;

typedef long long ll;

int main() {
    int n, m;
    cin >> n >> m;
    vector<pair<int, ll>> job(n);
    for (int i = 0; i < n; i++) cin >> job[i].first;
    for (int i = 0; i < n; i++) cin >> job[i].second;
    sort(job.rbegin(), job.rend());
    vector<pair<ll, int>> best(n);
    for (int i = 0; i < n; i++) {
        pair<ll, int> g = {0, 0};
        for (int j = 0; j < i; j++) {
            ll mon = best[j].second / job[i].first * job[i].second;
            pair<ll, int> o = {best[j].first + mon, best[j].second % job[i].first};
            g = max(g, o);
        }
        best[i] = max(g, {m / job[i].first * job[i].second, m % job[i].first});
    }
    cout << best[n - 1].first;
    return 0;
}