#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
inline char gc()
{
    static char buf[100000],*p1=buf,*p2=buf;
    return p1==p2&&(p2=(p1=buf)+fread(buf,1,100000,stdin),p1==p2)?EOF:*p1++;
}
template<typename T> inline void read(T &x)
{
    T u=1,t=0;char c=gc();
    while(c<'0'||c>'9') {if(c=='-') u=-1; c=gc();}
    while(c>='0'&&c<='9') t*=10,t+=c-'0',c=gc();
    x=u*t;return;
}
template<typename T,typename ...O> inline void read(T &x,O &...o) {read(x),read(o...);}
const int N=1000001;
int n,k,a[N],b[N],d[N];
ll f[N],g[N],h[N];
namespace sgt1
{
    struct tree
    {
        int l,r;
        ll s;
    }T[N<<2];
    void pushup(int x)
    {
        T[x].s=max(T[x<<1].s,T[x<<1|1].s);
    }
    void build(int x,int l,int r)
    {
        T[x].l=l,T[x].r=r;
        if(l==r)
        {
            T[x].s=a[l]-max(a[l]-b[l],0);
            return;
        }
        int z=l+r>>1;
        build(x<<1,l,z);
        build(x<<1|1,z+1,r);
        pushup(x);
    }
    ll sum(int x,int l,int r)
    {
        if(T[x].l>=l&&T[x].r<=r)
        {
            return T[x].s;
        }
        int z=T[x].l+T[x].r>>1;
        ll s=-1e18;
        if(l<=z) s=max(s,sum(x<<1,l,r));
        if(r>z) s=max(s,sum(x<<1|1,l,r));
        return s;
    }
}
namespace sgt2
{
    int T[N];
    void add(int x,int k)
    {
        while(x<=n) T[x]+=k,x+=x&-x;
    }
    int sum(int x)
    {
        int s=0;
        while(x>=1) s+=T[x],x-=x&-x;
        return s;
    }
}
bool check(int l,int r)
{
    return k-(f[r]-f[l-1])>=sgt1::sum(1,l,r);
}
int main()
{
    read(n),read(k);
    for(int i=1;i<=n;++i) read(a[i]);
    for(int i=1;i<=n;++i) read(b[i]);
    sgt1::build(1,1,n);
    for(int i=1;i<=n;++i)
    {
        f[i]=f[i-1]+max(a[i]-b[i],0);
        g[i]=g[i-1]+(b[i]-a[i]);
        h[i]=g[i];
    }
    sort(h+1,h+n+1);
    for(int i=1;i<=n;++i)
    {
        d[i]=lower_bound(h+1,h+n+1,g[i])-h;
    }
    int x=0;
    ll s=0;
    for(int i=1;i<=n;++i)
    {
        if(x<i) x=i-1;
        while(x+1<=n&&check(i,x+1)) sgt2::add(n-d[++x]+1,1);
        s+=sgt2::sum(n-d[i-1]+1);
        if(x>=i) sgt2::add(n-d[i]+1,-1);
    }
    printf("%lld",s);
    return 0;
}