#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=1e9+7;
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;
}
mt19937 rnd((unsigned)chrono::steady_clock::now().time_since_epoch().count());

int n, m, a[maxn], v[maxn], cho[maxn];
int s[maxn]; LL b[maxn];

int calc() {
	for(int i=1; i<=n; ++i) b[i]=a[i];
	for(int i=1; i<=n; ++i) b[i]+=cho[i], b[i%n+1]+=a[i]-cho[i];
	int l=0, r=m;
	while(l<r) {
		int mid=(l+r+1)>>1;
		//can 1  get mid
		LL oth=0;
		for(int i=2; i<=n; ++i) {
			//how many x: b[i]/x > b[1]/mid
			//b[i]*mid/b[1] > x
			oth+=(1LL*b[i]*mid+b[1]-1)/b[1]-1;
			if(oth>1LL*m) break;
		}
		if(oth+mid<=1LL*m) l=mid; else r=mid-1;
	}
	return l;
}

int main() {
	int st=clock();
	n=read(), m=read();
	for(int i=1; i<=n; ++i) v[i]=read();
	for(int i=1; i<=n; ++i) a[i]=read();
	
	for(int i=1; i<n; ++i) cho[i]=a[i]; cho[n]=0;
	int ans=calc();
	double T=1.0;
	while(clock()-st<900) {
		int x=rnd()%n+1, nw=rnd()%(a[x]+1);
		int pre=cho[x]; cho[x]=nw;
		int nxt=calc();
		if(nxt>=ans) ans=nxt;
			else {
				int t=rnd()%100001;
				if(t/100000.0<exp(-(1.0*ans-nxt)/T)) {
					ans=nxt;
				} else {
					cho[x]=pre;
				}
			}
		T*=0.999;
	}
	printf("%d", ans);
	return 0;
}