#include <bits/stdc++.h>

using namespace std;

using ll = long long;

const int N = 1e6;

int n, e, a[N + 5], b[N + 5];

struct SegmentTree {
  #define ls (u << 1)
  #define rs (ls | 1)
  struct node {
    int min, tag;
  } seg[N * 4 + 5];
  void apply(int k, int u) { seg[u].min += k, seg[u].tag += k; }
  void pushDown(int u) {
    if (!seg[u].tag) return ;
    apply(seg[u].tag, ls), apply(seg[u].tag, rs), seg[u].tag = 0;
  }
  void pushUp(int u) { seg[u].min = min(seg[ls].min, seg[rs].min); }
  void update(int l, int r, int k, int u, int tl, int tr) {
    if (l <= tl && tr <= r) return apply(k, u);
    int mid = (tl + tr) >> 1;
    pushDown(u);
    if (l <= mid) update(l, r, k, ls, tl, mid);
    if (r > mid) update(l, r, k, rs, mid + 1, tr);
    pushUp(u);
  }
  int query(int u, int tl, int tr) {
    if (seg[u].min >= 0) return tl - 1;
    if (tl == tr) return tl;
    int mid = (tl + tr) >> 1;
    pushDown(u);
    return seg[rs].min < 0 ? query(rs, mid + 1, tr) : query(ls, tl, mid);
  }
} seg;

int stk[N + 5], top;
ll sum[N + 5], ind[N + 5];
int len, sid[N + 5];
vector<pair<int, int>> qry[N + 5];

struct BinaryIndexedTree {
  int c[N + 5];
  void update(int x, int k) { for (; x <= len; x += x & -x) c[x] += k; }
  int query(int x) { int ret = 0; for (; x; x &= x - 1) ret += c[x]; return ret;}
} bit;

ll ans;

int main() {
  scanf("%d%d", &n, &e);
  for (int i = 1; i <= n; ++i) scanf("%d", a + i);
  for (int i = 1; i <= n; ++i) scanf("%d", b + i), ind[i] = sum[i] = sum[i - 1] + b[i] - a[i];
  sort(ind, ind + n + 1), len = unique(ind, ind + n + 1) - ind;
  for (int i = 0; i <= n; ++i) sid[i] = lower_bound(ind, ind + len, sum[i]) - ind + 1;
  seg.update(1, n, e, 1, 1, n);
  for (int i = 1; i <= n; ++i) {
    for (; top && min(a[i], b[i]) >= min(a[stk[top]], b[stk[top]]); --top) seg.update(stk[top - 1] + 1, stk[top], min(a[stk[top]], b[stk[top]]), 1, 1, n);
    seg.update(stk[top] + 1, i, -min(a[i], b[i]), 1, 1, n), stk[++top] = i;
    seg.update(1, i, min(b[i] - a[i], 0), 1, 1, n);
    qry[min(seg.query(1, 1, n), i)].emplace_back(sid[i], -1), qry[i].emplace_back(sid[i], 1);
  }
  for (int i = 1; i <= n; ++i) {
    bit.update(sid[i - 1], 1);
    for (auto [x, w]: qry[i]) ans += bit.query(x) * w;
  }
  printf("%lld\n", ans);
}