#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],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 ch[N*20][2],v[N*20],siz[N*20],rd[N*20];

class fhq
{
	public:
		#define ls ch[x][0]
		#define rs ch[x][1]
		
		int ro;
		
		inline void up(int x){siz[x]=siz[ls]+siz[rs]+1;}
		
		inline int make_new(int val)
		{
			int x=++tot;v[x]=val;siz[x]=1;rd[x]=rand();
			return x;
		}
		
		inline void split(int x,int k,int&a,int&b)
		{
			if(!x)a=b=0;
			else
			{
				if(v[x]<=k)a=x,split(rs,k,rs,b);
				else b=x,split(ls,k,a,ls);
				up(x);
			}
		}
		
		inline int merge(int a,int b)
		{
			if(!a||!b)return a+b;
			if(rd[a]<rd[b])
			{
				ch[a][1]=merge(ch[a][1],b);
				up(a);return a;
			}
			else
			{
				ch[b][0]=merge(a,ch[b][0]);
				up(b);return b;
			}
		}
		
		inline void add(int x)
		{
			int a=0,b=0;
			split(ro,x,a,b);int k=make_new(x);
			ro=merge(merge(a,k),b);
		}
		
		inline int the_rk_of(int x)
		{
			int a=0,b=0,ans;
			split(ro,x-1,a,b);
			ans=siz[a];
			ro=merge(a,b);
			return ans;
		}
}t[N];

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

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

main()
{
//	freopen("in.txt","r",stdin);
//	freopen("top.in","r",stdin);
//	freopen("top.out","w",stdout);
	srand(time(0));
	read(n);read(E);
	for(int i=1;i<=n;i++)read(a[i]),ro[i]=g[i]=i;
	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=0;i<=n;i++)h[g[i]]=i+1;
	st[++top]=1;insert(n,h[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<<ans;
}