#include<bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
 
using namespace std;
using namespace __gnu_pbds;
typedef long long int lld;
typedef tree<int,null_type,less<int>,rb_tree_tag,tree_order_statistics_node_update> ordered_set;
#define rep(i,a,b) for(int i=a;i<b;i++)
#define trav(a,v) for(auto a:v)
const int MX=4000;
lld DP[MX];
lld nx[MX];
const lld INF=1e18;
void solve(){
	int n;
	lld S;
	cin>>n>>S;
	vector<pair<lld,lld> >V(n);
	rep(i,0,n)cin>>V[i].second;
	rep(i,0,n)cin>>V[i].first;
	sort(V.begin(),V.end());
	reverse(V.begin(),V.end());
	rep(i,0,MX)DP[i]=INF;
	DP[0]=0;
	rep(i,0,n){
		rep(j,0,MX){
			nx[j]=DP[j];
		}
		rep(j,1,MX)nx[j]=min(nx[j],DP[j-1]+V[i].first*(j-1)+V[i].second);
		rep(j,0,MX){
			DP[j]=nx[j];
			//cout<<DP[j]<<" ";
		}//cout<<endl;
	}
	rep(i,0,MX){
		if(DP[i]>S){
			cout<<i-1<<"\n";
			return;
		}
	}
	cout<<n<<"\n";
}

int main(){
	ios::sync_with_stdio(0);
	cin.tie(0);
	int tt=1;
	//cin>>tt;
	while(tt--){
		solve();
	}
}