#include <bits/stdc++.h>

using namespace std;

using ll = long long;

int main()
{
    ios::sync_with_stdio(false);
    cin.tie(nullptr);

    int N;
    cin >> N;
    ll B;
    cin >> B;
    vector<ll> C(N);
    vector<ll> S(N);
    for (int i = 0; i < N; i++)
    {
        cin >> C[i];
    }
    for (int i = 0; i < N; i++)
    {
        cin >> S[i];
    }

    ll ans = 0;

    for (int i = 0; i < N; i++)
    {
        vector<pair<ll, ll>> cards;
        for (int j = 0; j < N; j++)
        {
            if (j == i)
            {
                cards.emplace_back(1, S[i]);
            }
            else
            {
                cards.emplace_back(C[j], S[j]);
            }
        }

        sort(cards.begin(), cards.end());

        ll bought = 0;
        ll money = B;

        for (int j = 0; j < cards.size(); j++)
        {
            ll count = min(cards[j].second, money / cards[j].first);
            money -= count * cards[j].first;
            bought += count;
        }

        ans = max(ans, bought);
    }

    cout << ans << endl;
}