#include <bits/stdc++.h>
using namespace std;
template <class T>
inline T bigmod(T p, T e, T M) {
  long long int ret = 1;
  for (; e > 0; e >>= 1) {
    if (e & 1) ret = (ret * p) % M;
    p = (p * p) % M;
  }
  return (T)ret;
}
template <class T>
inline T gcd(T a, T b) {
  if (b == 0) return a;
  return gcd(b, a % b);
}
template <class T>
inline T modinverse(T a, T M) {
  return bigmod(a, M - 2, M);
}
template <class T>
inline T bpow(T p, T e) {
  long long int ret = 1;
  for (; e > 0; e >>= 1) {
    if (e & 1) ret = (ret * p);
    p = (p * p);
  }
  return (T)ret;
}
int toInt(string s) {
  int sm;
  stringstream ss(s);
  ss >> sm;
  return sm;
}
int toLlint(string s) {
  long long int sm;
  stringstream ss(s);
  ss >> sm;
  return sm;
}
const double eps = 1e-9;
int ts, kk = 1;
long long int a[100005], b[100005];
int n, m;
int main() {
  int i, j, k;
  scanf("%d%d", &n, &m);
  for (i = 0; i < n; i++) scanf("%I64d", &a[i]);
  for (i = 0; i < n; i++) scanf("%I64d", &b[i]);
  long long int lo = 0;
  long long int hi = 1000000007LL + 1000000007LL;
  long long int md, rs = 0;
  while (lo <= hi) {
    md = (lo + hi) / 2;
    long long int q = m;
    for (i = 0; i < n && q >= 0; i++) {
      int cnt = (b[i] / a[i]);
      if (cnt >= md) continue;
      cnt = md - cnt;
      q += b[i] % a[i];
      q -= cnt * a[i];
    }
    if (q >= 0) {
      rs = md;
      lo = md + 1;
    } else
      hi = md - 1;
  }
  printf("%I64d\n", rs);
  return 0;
}
