#include <bits/stdc++.h>
#ifdef dbg
#define D(...) fprintf(stderr, __VA_ARGS__)
#define DD(...) D("[Debug] "#__VA_ARGS__ " = "), \
              debug_helper::debug(__VA_ARGS__), D("\n")
#include "C:\Users\wsyear\Desktop\OI\templates\debug.hpp"
#else
#define D(...) ((void)0)
#define DD(...) ((void)0)
#endif
#define rep(i, j, k) for (int i = (j); i <= (k); ++i)
#define per(i, j, k) for (int i = (j); i >= (k); --i)
#define SZ(v) int((v).size())
#define ALL(v) (v).begin(),(v).end()
#define fi first
#define se second
using ll = long long;
using pii = std::pair<int, int>;
using pll = std::pair<ll, ll>;

template<class T> void chkmn(T &x, T y) { if (y < x) x = y; }
template<class T> void chkmx(T &x, T y) { if (y > x) x = y; }

using namespace std;

const int maxn = 1000010;

int n, E, a[maxn], b[maxn], t[maxn];
ll s[maxn], sum[maxn], mx[maxn], v1[maxn], v2[maxn], ans;
pii que[maxn];

void upd(int x, int v) {
  while (x <= n) t[x] += v, x += x & (-x);
}

int qry(int x) {
  int res = 0;
  while (x) res += t[x], x -= x & (-x);
  return res;
}

void solve(int l, int r) {
  if (l == r) return ans += (a[l] <= E && a[l] <= b[l]), void();
  int mid = (l + r) >> 1;
  solve(l, mid), solve(mid + 1, r);
  s[mid] = b[mid] - a[mid], sum[mid] = min(0, b[mid] - a[mid]);
  per (i, mid - 1, l) s[i] = s[i + 1] + b[i] - a[i];
  per (i, mid - 1, l) sum[i] = sum[i + 1] + min(0, b[i] - a[i]);
  mx[mid] = min(a[mid], b[mid]);
  per (i, mid - 1, l) mx[i] = max(mx[i + 1], 1ll * min(a[i], b[i]));
  s[mid + 1] = b[mid + 1] - a[mid + 1], sum[mid + 1] = min(0, b[mid + 1] - a[mid + 1]);
  rep (i, mid + 2, r) s[i] = s[i - 1] + b[i] - a[i];
  rep (i, mid + 2, r) sum[i] = sum[i - 1] + min(0, b[i] - a[i]);
  mx[mid + 1] = min(a[mid + 1], b[mid + 1]);
  rep (i, mid + 2, r) mx[i] = max(mx[i - 1], 1ll * min(a[i], b[i]));
  rep (i, l, r) v1[i] = mx[i] - sum[i], v2[i] = sum[i] + E;
  rep (i, l, r) que[i] = pii(-1, -1);
  int pos = mid, p1 = l, p2 = mid;
  rep (i, mid + 1, r) {
    while (pos >= l && mx[pos] < mx[i]) pos--;
    while (p1 <= mid && v1[p1] > v2[i]) p1++;
    while (p2 >= l && v1[i] > v2[p2]) p2--;
    if (p1 > pos && p2 < pos + 1) ;
    else if (p1 > pos) que[i] = pii(pos + 1, p2);
    else if (p2 < pos + 1) que[i] = pii(p1, pos);
    else que[i] = pii(p1, p2);
  }
  rep (i, l, mid) s[i] = -s[i];
  vector<pii> vec(0);
  rep (i, l, r) vec.emplace_back(s[i], i);
  sort(ALL(vec));
  for (auto tmp : vec) {
    int x = tmp.se;
    if (x <= mid) upd(x, 1);
    else if (que[x] != pii(-1, -1)) ans += qry(que[x].se) - qry(que[x].fi - 1);
  }
  rep (i, l, mid) upd(i, -1);
}

int main() {
  cin.tie(nullptr) -> ios::sync_with_stdio(false);
  cin >> n >> E;
  rep (i, 1, n) cin >> a[i];
  rep (i, 1, n) cin >> b[i];
  solve(1, n);
  cout << ans << '\n';
}