#include<iostream>
#include<iomanip>
#include<cmath>
#include<string>
#include<cstring>
#include<vector>
#include<list>
#include<algorithm>
#include<map>
#include<set>
#include<queue>
#include<stack>
using namespace std;
typedef long long ll;
#define fi first
#define se second
#define mp make_pair
#define rep(i, n) for(int i=0;i<n;++i)
#define rrep(i, n) for(int i=n;i>=0;--i)
const int inf=1e9+7;
const ll mod=1e9+7;
const ll big=1e18;
const double PI=2*asin(1);

int main() {
  ll N, D;
  cin>>N>>D;
  int x;
  for(int i=0;i<N;++i) cin>>x;
  ll sumv = 0;
  ll v;
  for(int i=0;i<N;++i) {
    cin>>v;
    sumv += v;
  }
  if(D%sumv==0) cout<<D/sumv<<endl;
  else cout<<D/sumv+1<<endl;
}