#include<bits/stdc++.h>
namespace {
#pragma GCC diagnostic ignored "-Wunused-function"
#include<atcoder/all>
#pragma GCC diagnostic warning "-Wunused-function"
using namespace std;
using namespace atcoder;
#define rep(i,n) for(int i = 0; i < (int)(n); i++)
#define rrep(i,n) for(int i = (int)(n) - 1; i >= 0; i--)
#define all(x) begin(x), end(x)
#define rall(x) rbegin(x), rend(x)
template<class T> bool chmax(T& a, const T& b) { if (a < b) { a = b; return true; } else return false; }
template<class T> bool chmin(T& a, const T& b) { if (b < a) { a = b; return true; } else return false; }
using ll = long long;
using P = pair<int,int>;
using VI = vector<int>;
using VVI = vector<VI>;
using VL = vector<ll>;
using VVL = vector<VL>;

} int main() {
  ios::sync_with_stdio(false);
  cin.tie(0);
  int n, b;
  cin >> n >> b;
  vector<P> d(n);
  rep(i, n) cin >> d[i].first;
  rep(i, n) cin >> d[i].second;
  sort(all(d));
  VL s(n + 1);
  VL sc(n + 1);
  rep(i, n) {
    s[i+1] = s[i] + (ll)d[i].first * d[i].second;
    sc[i+1] = sc[i] + d[i].second;
  }
  int ans = 0;
  rep(i, n) {
    int rest = b;
    int res = 0;
    int t = min(b, d[i].second);
    rest -= t;
    res += t;
    int l = 0, r = n + 1;
    while (r - l > 1) {
      int c = (l + r) / 2;
      ll sm = s[c];
      if (i < c) sm -= (ll)d[i].first * d[i].second;
      (sm <= rest ? l : r) = c;
    }
    ll sm = s[l], cnt = sc[l];
    if (i < l) {
      sm -= (ll)d[i].first * d[i].second;
      cnt -= d[i].second;
    }
    rest -= sm;
    res += cnt;
    if (l < n) res += rest / d[l].first;
    chmax(ans, res);
  }
  cout << ans << '\n';
}