#include <cassert>
#include <cmath>
#include <cstdint>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <algorithm>
#include <bitset>
#include <complex>
#include <deque>
#include <functional>
#include <iostream>
#include <limits>
#include <map>
#include <numeric>
#include <queue>
#include <random>
#include <set>
#include <sstream>
#include <string>
#include <unordered_map>
#include <unordered_set>
#include <utility>
#include <vector>

using namespace std;

using Int = long long;

template <class T1, class T2> ostream &operator<<(ostream &os, const pair<T1, T2> &a) { return os << "(" << a.first << ", " << a.second << ")"; };
template <class T> ostream &operator<<(ostream &os, const vector<T> &as) { const int sz = as.size(); os << "["; for (int i = 0; i < sz; ++i) { if (i >= 256) { os << ", ..."; break; } if (i > 0) { os << ", "; } os << as[i]; } return os << "]"; }
template <class T> void pv(T a, T b) { for (T i = a; i != b; ++i) cerr << *i << " "; cerr << endl; }
template <class T> bool chmin(T &t, const T &f) { if (t > f) { t = f; return true; } return false; }
template <class T> bool chmax(T &t, const T &f) { if (t < f) { t = f; return true; } return false; }
#define COLOR(s) ("\x1b[" s "m")


constexpr Int INF = 1001001001001001001LL;

int N;
Int M;
vector<Int> V, A;


namespace brute {
Int dp[1010][1010];
bool check(int want) {
  for (int i = 0; i <= N; ++i) {
    fill(dp[i], dp[i] + (M - want + 1), INF);
  }
  dp[1][0] = 0;
  for (int i = 1; i < N; ++i) {
    /*
    for (int x = 0; x <= M - want; ++x) if (dp[i][x] < INF) {
      for (int y = 0; x + y <= M - want; ++y) {
        // v[i] / (y + 1) <= V[0] / want
        const Int w = V[0] * (y + 1) / want - (V[i] + dp[i][x]);
        if (w >= 0) {
          chmin(dp[i + 1][x + y], max(A[i] - w, 0LL));
        }
      }
    }
    //*/
    //*
    Int mx = -INF;
    for (int x = 0; x <= M - want; ++x) {
      if (dp[i][x] < INF) {
        chmax(mx, V[0] * (-x + 1) - (V[i] + dp[i][x]) * want);
      }
      Int w = V[0] * x + mx;
      if (w >= 0) {
        w /= want;
        chmin(dp[i + 1][x], max(A[i] - w, 0LL));
      }
    }
    //*/
// cerr<<"want = "<<want<<", dp["<<i+1<<"] = ";pv(dp[i+1],dp[i+1]+(M-want+1));
  }
  return (dp[N][M - want] < INF);
}
Int run() {
cerr<<"[brute::run]"<<endl;
  int lo = 0, hi = M + 1;
  for (; lo + 1 < hi; ) {
    const int mid = (lo + hi) / 2;
    (check(mid) ? lo : hi) = mid;
  }
  return lo;
}
}  // brute


int main() {
  for (; ~scanf("%d%lld", &N, &M); ) {
    V.resize(N); for (int i = 0; i < N; ++i) scanf("%lld", &V[i]);
    A.resize(N); for (int i = 0; i < N; ++i) scanf("%lld", &A[i]);
    V[0] += A[0] + A[N - 1];
    A[0] = A[N - 1] = 0;
    
    const Int ans = brute::run();
    printf("%lld\n", ans);
  }
  return 0;
}