#include<bits/stdc++.h>

#define vc vector
#define pb emplace_back
#define pii pair<int, int>
#define mkp make_pair
#define rep(i, a, b) for(int i = (a); i <= (b); i++)
#define lep(i, a, b) for(int i = (a); i >= (b); i--)

#define int long long

using namespace std;

inline int read() {
	int x = 0, w = 0; char ch = getchar(); while(!isdigit(ch)) w |= (ch == '-'), ch = getchar();
	while(isdigit(ch)) x = x * 10 + (ch ^ 48), ch = getchar(); return w ? -x : x;
}

const int N = 1e6 + 5;

int n, E, ans, len, a[N], b[N], s[N], num[N];
int X[N], Y[N];

namespace bit {
	int tre[N];
	#define lb(x) (x & -x)
	inline void add(int p, int v) { while(p <= len) tre[p] += v, p += lb(p); }
	inline void reset(int p) { while(p <= len) tre[p] = 0, p += lb(p); }
	inline int ask(int p) { int res = 0; while(p) res += tre[p], p -= lb(p); return res; }
}

inline void solve(int l, int r) {
	if(l == r) {
		ans += b[l] >= a[l] && a[l] <= E;
		return ;
	}
	
	int mid = l + r >> 1;
	solve(l, mid); solve(mid + 1, r);
	
	for(int i = mid + 1, x = 0, y = 0; i <= r; i++) {
		if(a[i] > b[i]) x = max(x + a[i] - b[i], y + a[i]), y += a[i] - b[i];
		else x = max(x, y + a[i]);
		X[i] = x; Y[i] = y; 
	}
	for(int i = mid, x = 0, y = 0; i >= l; i--) {
		if(a[i] > b[i]) x = max(x + a[i] - b[i], y + a[i]), y += a[i] - b[i];
		else x = max(x, y + a[i]);
		X[i] = x; Y[i] = y;
	}
	
	// max in right
	for(int i = mid + 1, p = mid, q = mid; i <= r; i++) {
		while(p >= l && X[p] - Y[p] <= X[i] - Y[i]) {
			if(q < p) bit::add(s[p - 1], 1);
			--p;
		}
		while(q >= l && Y[q] + X[i] <= E) {
			if(p < q) bit::add(s[q - 1], 1);
			--q;
		}
		while(q < mid && Y[q + 1] + X[i] > E) {
			++q;
			if(p < q) bit::add(s[q - 1], -1);
		}
		if(max(p, q) < mid) ans += bit::ask(s[i]);
	}
	rep(i, l, mid) bit::reset(s[i - 1]);
	
	// max in left
	for(int i = mid + 1, p = mid + 1, q = mid; i <= r; i++) {
		while(p > l && X[p - 1] - Y[p - 1] <= X[i] - Y[i]) {
			--p;
			if(q < p) bit::add(s[p - 1], -1);
		}
		while(q >= l && X[q] + Y[i] <= E) {
			if(q < p) bit::add(s[q - 1], 1);
			--q;
		}
		while(q < mid && X[q + 1] + Y[i] > E) {
			++q;
			if(q < p) bit::add(s[q - 1], -1);
		}
		if(q + 1 < p) ans += bit::ask(s[i]);
	}
	rep(i, l, mid) bit::reset(s[i - 1]);
}

signed main() {
	n = read(); E = read();
	rep(i, 1, n) a[i] = read();
	rep(i, 1, n) b[i] = read(), num[++len] = s[i] = s[i - 1] + b[i] - a[i];
	
	num[++len] = 0;
	sort(num + 1, num + 1 + len);
	len = unique(num + 1, num + 1 + len) - num - 1;
	rep(i, 0, n) s[i] = lower_bound(num + 1, num + 1 + len, s[i]) - num;
	
	solve(1, n);
	
	cout << ans << endl;
	return 0;
}