#include<bits/stdc++.h>
using namespace std;
#define fi first
#define se second
#define int long long
#define el cout<<"\n"
#define sz(x) (int)(x).size()
#define all(x) (x).begin(),(x).end()
#define f0(i,n) for(int i=0;i<n;i++)
#define f1(i,n) for(int i=1;i<=n;i++)
#define fz(i,a,n,z) for(int i=a;i<n;i+=z)
#define rep(i,a,n,z) for(int i=a;i>n;i-=z)
#define faster ios_base::sync_with_stdio(false);cin.tie(0);cout.tie(0);
#define file(name) if(fopen(name".in","r")){freopen(name".in","r",stdin);freopen(name".out","w",stdout);}
const int MAXN = 1e6+5;
const int mod =1e9+7;
int c[MAXN],p[MAXN];
signed main(){
   faster;
   file("");
   int n,k;cin>>n>>k;
   f1(i,n) cin>>c[i];
   f1(i,n) cin>>p[i];
   int j=1,ans=0,s=0;
   deque<int> q;
   f1(i,n){
       s+=p[i];
       while(sz(q) && c [q.back()] < c[i]) q.pop_back();
       q.push_back(i);
       int cur = c[q.front()]+(i-j+1)*s;
       while(cur > k){
            s-=p[j];
            if(sz(q) && q.front()<=j) q.pop_front();
            j++;
            cur = (j == i ? 0 : c[q.front()]) + (i-j+1)*s;
        }
        ans=max(ans,i-j+1);
   }
   cout<<ans;
}