#include <bits/stdc++.h>
#define rep(i,j,k) for(int i=(j);i<=(k);i++)
#define per(i,j,k) for(int i=(j);i>=(k);i--)
#define uint unsigned int
#define ll long long
#define ull unsigned long long
#define db double
#define ldb long double
#define pii pair<int,int>
#define pll pair<ll,ll>
#define mkp make_pair
#define eb emplace_back
#define SZ(S) (int)S.size()
//#define mod 998244353
//#define mod 1000000007
#define inf 0x3f3f3f3f
#define linf 0x3f3f3f3f3f3f3f3f
using namespace std;

template <class T>
void chkmax(T &x,T y){
	if(x < y) x = y;
}

template <class T>
void chkmin(T &x,T y){
	if(x > y) x = y;
}

inline int popcnt(int x){
	return __builtin_popcount(x);
}

inline int ctz(int x){
	return __builtin_ctz(x);
}


/*ll power(ll p,int k = mod - 2){
	ll ans = 1;
	while(k){
		if(k % 2 == 1) ans = ans * p % mod;
		p = p * p % mod;
		k /= 2;	
	}
	return ans;
}*/
int n,S;
int c[100005],p[100005],ord[100005],tmp[100005];

bool cmp(int x,int y){
	return p[x] > p[y];
}

int cnt;
struct node{
	int siz,l,r,w;
	ll val,tag,rktag;
}tree[100005];
#define ls(rt) tree[rt].l
#define rs(rt) tree[rt].r
void upd(int rt,ll C1,ll C2){
	tree[rt].val += C1;
	tree[rt].val += (tree[ls(rt)].siz + 1) * C2;
	tree[rt].tag += C1;
	tree[rt].rktag += C2;
}

void pushdown(int rt){
	upd(ls(rt),tree[rt].tag,tree[rt].rktag);
	upd(rs(rt),tree[rt].tag + tree[rt].rktag * (tree[ls(rt)].siz + 1),tree[rt].rktag);
	tree[rt].tag = tree[rt].rktag = 0;
}

void pushup(int rt){
	tree[rt].siz = tree[ls(rt)].siz + tree[rs(rt)].siz + 1;
}

void split(int rt,ll val,int &x,int &y){
	if(!rt){
		x = y = 0;
		return;
	}
	pushdown(rt);
	if(tree[rt].val <= val){
		x = rt;
		split(rs(rt),val,rs(rt),y);
	}else{
		y = rt;
		split(ls(rt),val,x,ls(rt));
	}
	pushup(rt);
}

int Merge(int x,int y){
	if(!x || !y) return x + y;
	if(tree[x].w < tree[y].w){
		pushdown(x);
		rs(x) = Merge(rs(x),y);
		pushup(x);
		return x;
	}else{
		pushdown(y);
		ls(y) = Merge(x,ls(y));
		pushup(y);
		return y;
	}
}
int rt;

void ins(int u,int val){
	int a,b;
	split(rt,val,a,b);
	rt = Merge(a,Merge(u,b));
}
mt19937 rnd(0);

int N;
ll ans[100005];
void travel(int u){
	if(!u) return;
	pushdown(u);
	travel(ls(u));
	ans[++N] = tree[u].val;
	travel(rs(u));
}
int main(){
//	freopen("test.in","r",stdin);
//	freopen("test.out","w",stdout);
	scanf("%d%d",&n,&S);
	rep(i,1,n) scanf("%d",&c[i]);
	rep(i,1,n){
		scanf("%d",&p[i]);
		ord[i] = i;
	}
	sort(ord + 1,ord + n + 1,cmp);
	rep(i,1,n) tmp[i] = p[ord[i]];
	rep(i,1,n) p[i] = tmp[i];
	rep(i,1,n) tmp[i] = c[ord[i]];
	rep(i,1,n) c[i] = tmp[i];	

	rep(i,1,n){
		tree[i].siz = 1;
		tree[i].w = rnd();tree[i].val = c[i];
		ins(i,c[i]);
		upd(rt,-p[i] + p[i + 1],p[i] - p[i + 1]);
		N = 0;
//		travel(rt);
//		rep(k,1,N) printf("%lld ",ans[k]);
//		printf("\n");
	}
	travel(rt);
	int output = 0;
	while(output < n && S >= ans[output + 1]){
		output++;
		S -= ans[output];
	}
	printf("%d\n",output);
	return 0;
}