#include using namespace std; typedef long long ll; typedef long double ld; typedef pair Pii; typedef pair Pil; typedef pair Pll; typedef pair Pli; #define fi first #define se second const ll MOD = 1e9 + 7; const ll MOD2 = 998244353; const ll MOD3 = 1812447359; const ll INF = 1ll << 62; const double PI = 2 * asin(1); void yes() {printf("yes\n");} void no() {printf("no\n");} void Yes() {printf("Yes\n");} void No() {printf("No\n");} void YES() {printf("YES\n");} void NO() {printf("NO\n");} int N; ll D, X[int(1e5+5)], V[int(1e5+5)]; int main(){ cin >> N >> D; for (int i = 0; i < N; i++) cin >> X[i]; ll sum = 0; for (int i = 0; i < N; i++){ cin >> V[i]; sum += V[i]; } ll ans = D / sum; if (D % sum != 0) ans++; cout << ans << endl; return 0; }