#include #define rep(i,n) for(int i = 0; i < (n); ++i) #define srep(i,s,t) for (int i = s; i < t; ++i) #define drep(i,n) for(int i = (n)-1; i >= 0; --i) using namespace std; typedef long long int ll; typedef pair P; #define yn {puts("YES");}else{puts("NO");} #define MAX_N 200005 int main() { ll n, d; cin >> n >> d; ll x[n], v[n]; ll sum = 0; rep(i,n) cin >> x[i]; rep(i,n){ cin >> v[i]; sum += v[i]; } ll ans = (d - 1) / sum + 1; cout << ans << endl; return 0; }