#pragma GCC optimize("Ofast")
#include<iostream>
#include<stdio.h>
#include<algorithm>
#include<vector>
#include<string.h>
#include<math.h>
#include<map>
#include<iomanip>
#include<queue>

using namespace std;

int main(){	
	
	long long n,d;
	cin >> n >> d;
	vector<long long> x(n),v(n);
	
	for(long long i=0;i<n;i++){
		cin >> x[i];
	}
	
	long long sum=0;
	for(long long i=0;i<n;i++){
		cin >> v[i];
		sum+=v[i];
	}
	long long ans=(d+sum-1)/sum;
	cout << ans << endl;
	return 0;
}