#include <bits/stdc++.h>
 
using namespace std;
 
#define ll long long
#define endl "\n"
#define pll pair<ll, ll>
#define fs first
#define sc second
#define vll vector<ll>
#define v2d vector<vector<ll>>
#define vpll vector<pll>
#define qll queue<ll>
#define stll stack<ll>
#define sll set<ll>
#define mll map<ll, ll>

ll n, l;
vll t, p;
map <double, priority_queue<pair<ll, ll>>> m, m2;
priority_queue<double> q;

void solve()
{
    cin >> n >> l;
    t.resize(n);
    p.resize(n);
    for (ll i = 0; i < n; i++) cin >> t[i];
    for (ll i = 0; i < n; i++) cin >> p[i];
    for (ll i = 0; i < n; i++)
    {
        double a = (double) p[i] / (double) t[i];
        q.push(a);
        m[a].push({p[i], t[i]});
    }
    ll ans = 0;
    while(l > 0 && q.size() > 0)
    {
        if (m[q.top()].size() == 0)
        {
            q.pop();
            continue;
        }
        if (m[q.top()].top().sc > l) m[q.top()].pop();
        else
        {
            l -= m[q.top()].top().sc;
            ans += m[q.top()].top().fs;
        }
    }
    cout << ans;
}
 
signed main()
{
    ios_base::sync_with_stdio(false);
    cin.tie(NULL); cout.tie(NULL);
    ll t = 1;
    //cin >> t;
    while(t--)
    {
        solve();
    }
    return 0;
}