#include <bits/stdc++.h>
#define il inline
#define pii pair<int,int>
#define fi first
#define se second
using namespace std;
typedef long long ll;
il int read(){
    int x=0,c=getchar();
    while(!isdigit(c)) c=getchar();
    while(isdigit(c)) x=x*10+c-48,c=getchar();
    return x;
}
il void cmin(ll &x,ll y){x=x<y?x:y;}
il void cmax(ll &x,ll y){x=x>y?x:y;}
const int N=1e6+5;const ll inf=1e18;
int n,m,k,b[N],c[N],p[N],q[N],id[N];pii a[N];ll s[N],t[N],d[N],ans;
int tree[N];
il void add(int x,int v){while(x<=k) tree[x]+=v,x+=(x&-x);}
il int get(int x){int ret=0;while(x) ret+=tree[x],x-=(x&-x);return ret;}
void solve(int l,int r){
    if(l>r) return ;
    if(l==r){if(a[l].fi<=a[l].se && m>=a[l].fi) ++ans;return ;}
    int mid=(l+r)>>1,x,y,z,u,v,w;solve(l,mid),solve(mid+1,r);
    c[mid]=b[mid],c[mid+1]=b[mid+1];
    for(int i=mid-1;i>=l;--i) c[i]=max(b[i],c[i+1]);
    for(int i=mid+2;i<=r;++i) c[i]=max(b[i],c[i-1]);
    x=mid;
    for(int i=mid;i>=l;--i){
        while(x<r && c[x+1]<=c[i]) ++x;
        if(x>mid) y=upper_bound(t+1,t+r+1,m-c[i]+t[i-1])-t-1;else y=0;
        p[i]=min(x,y);
    }
    for(int i=l;i<=mid;++i) id[i]=i;
    stable_sort(id+l,id+mid+1,[](int x,int y){return p[x]<p[y];});
    x=mid;
    for(int i=l;i<=mid;++i){
        while(x<r && x<p[id[i]]) add(s[++x],1);
        if(x>mid) ans+=1ll*get(s[id[i]-1]);
    }
    for(int i=mid+1;i<=x;++i) add(s[i],-1);
    x=mid+1,y=l-1;
    for(int i=mid+1;i<=r;++i){
        while(x>l && c[x-1]<c[i]) --x;
        while(y<=mid && t[i]+1ll*c[i]-1ll*m>t[y]) ++y;
        p[i]=max(x,y+1);
    }
    for(int i=mid+1;i<=r;++i) id[i]=i;
    stable_sort(id+mid+1,id+r+1,[](int x,int y){return p[x]>p[y];});
    x=mid+1;
    for(int i=mid+1;i<=r;++i){
        while(x>l && x>p[id[i]]) --x,add(s[x-1],1);
        if(x<=mid) ans+=1ll*(mid-x+1ll)-get(s[id[i]]-1);
    }
    for(int i=mid;i>=x;--i) add(s[i-1],-1);
}
ll x,y,z;int u,v,w,ck;
int main(){
    //freopen("a4.in","r",stdin);
    scanf("%d%d",&n,&m);
    for(int i=1;i<=n;++i) a[i].fi=read();
    for(int i=1;i<=n;++i) a[i].se=read();
    for(int i=1;i<=n;++i){
        s[i]=s[i-1]+1ll*a[i].fi-a[i].se;
        t[i]=t[i-1]+1ll*max(0,a[i].fi-a[i].se);
        b[i]=min(a[i].fi,a[i].se);
    }
    for(int i=0;i<=n;++i) d[++k]=s[i];
    sort(d+1,d+1+k);k=unique(d+1,d+1+k)-d-1;
    for(int i=0;i<=n;++i) s[i]=lower_bound(d+1,d+1+k,s[i])-d;
    solve(1,n);
    printf("%lld",ans);

    return 0;
}