#include<cstdio>
#include<cstring>
#include<algorithm>
#include<vector>
#include<cassert>
#include<set>
#include<random>
#include<chrono>
#include<bitset>
#include<queue>
#include<cstdlib>
#include<cmath>

using namespace std;
const int maxn=1e5+10, inf=1e9, P=1000026113;
const double eps=1e-10;
typedef long long LL;
typedef unsigned long long ULL;
const LL INF=4e18;
typedef pair<LL, int> pli;
typedef pair<int, int> pii;
inline int read() {
	int x=0, f=1; char c=getchar();
	for(; c<'0'||c>'9'; c=getchar()) if(c=='-') f=0;
	for(; c>='0'&&c<='9'; c=getchar()) x=x*10+c-'0';
	return f?x:-x;
}

int a[maxn], v[maxn];
int f[60][260];

int main() {
	int n=read(), m=read();
	for(int i=1; i<=n; ++i) v[i]=read();
	int mxa=0;
	for(int i=1; i<=n; ++i) a[i]=read(), mxa=max(mxa, a[i]);
	int l=0, r=m, b1=v[1]+a[1]+a[n];
	while(l<r) {
		int mid=(l+r+1)>>1;
		for(int i=1; i<=n; ++i)
			for(int j=0; j<=mxa; ++j) f[i][j]=inf;
		f[1][0]=0;
		for(int i=1; i<n-1; ++i)
			for(int j=0; j<=mxa; ++j) {
				int cur=f[i][j];
				if(cur==inf) continue;
				for(int k=0; k<=a[i+1]; ++k)
					f[i+1][a[i+1]-k]=min(f[i+1][a[i+1]-k], cur+((j+k+v[i+1])*mid+b1-1)/b1-1);
			}
		int ans=inf;
		for(int i=0; i<=mxa; ++i)
			ans=min(ans, f[n-1][i]+((i+v[n])*mid+b1-1)/b1-1);
	//	printf("%d  %d\n", mid, ans);
		if(ans<=m-mid) l=mid; else r=mid-1;
	}
	printf("%d\n", l);
	return 0;
}