#pragma GCC optimize("Ofast","inline")
#include<bits/stdc++.h>
#define int long long
using namespace std;
const int N=2e6+50;

void read(int&x)
{
	char c;
	while(c=getchar(),c<'0'||c>'9');x=c-'0';
	while(c=getchar(),c>='0'&&c<='9')x=x*10+c-'0';
}

int n,E,a[N],b[N],p[N],ro[N],st[N],top,fir[N],ans,w[N],f[N],t[N],tot,g[N],h[N];

bool cmp(int a,int b)
{
	return f[a]==f[b]?a<b:f[a]<f[b];
}

int find(int x)
{
	return x==ro[x]?x:(ro[x]=find(ro[x]));
}

int val(int x)
{
	return E-p[find(x)]+fir[x-1];
}

int tl[N<<2],tr[N<<2],sum[N];

#define ls tl[x]
#define rs tr[x]
#define mid ((l+r)>>1)
#define LS ls,l,mid
#define RS rs,mid+1,r

void insert(int&x,int l,int r,int d)
{
	if(!x)x=++tot;++sum[x];
	if(l==r)return;
	if(d<=mid)insert(LS,d);
	else insert(RS,d);
}

int find(int x,int l,int r,int d)
{
	if(!x)return 0;
	if(d>=r)return sum[x];
	if(d<=mid)return find(LS,d);
	return find(LS,d)+find(RS,d);
}

void insert(int x,int val)
{
	for(int i=x;i<=n;i+=(i&(-i)))insert(t[i],1,n+1,val);
}

int find(int x,int val)
{
	int ans=0;
	for(int i=x;i;i-=(i&(-i)))ans+=find(t[i],1,n+1,val);
	return ans;
}

main()
{
//	freopen("in.txt","r",stdin);
//	freopen("top.in","r",stdin);
//	freopen("top.out","w",stdout);
	read(n);read(E);
	for(int i=1;i<=n;i++)read(a[i]),ro[i]=t[i]=g[i]=i;tot=n;
	for(int i=1;i<=n;i++)read(b[i]),fir[i]=fir[i-1]+(w[i]=max(0ll,a[i]-b[i])),p[i]=a[i]-w[i],f[i]=f[i-1]+b[i]-a[i];
	sort(g,g+1+n,cmp);
	for(int i=1;i<=n;i++)h[g[i]]=i+1;
	st[++top]=1;insert(n,0);ans+=b[1]>=a[1];
	for(int i=2;i<=n;i++)
	{
		while(top&&p[st[top]]<=p[i])ro[st[top--]]=i;
		st[++top]=i;
		int l=1,r=i-1,t=i+1;
		while(l<=r)
		{
			int pos=(l+r)>>1;
			if(fir[i]<=val(pos))t=pos,r=pos-1;
			else l=pos+1;
		}
		insert(n-i+1,h[i-1]);ans+=find(n-t+1,h[i]);
//		cout<<i<<' '<<t<<' '<<find(1)<<' '<<ans<<'\n';
	}
	cout<<ans;
}