// clang-format off
#include <bits/stdc++.h>

using namespace std;

#if __cplusplus < 201400
  #warning "Please use c++14 or higher."
  #define INLINE_V
  #define REGISTER_V register
  #define CPP14CONSTEXPR
  #define gcd __gcd
  #define CPP14ENABLE_IF
#elif __cplusplus < 201700
  #define INLINE_V
  #define REGISTER_V
  #define CPP14CONSTEXPR constexpr
  #define gcd __gcd
  #define CPP14ENABLE_IF ,enable_if_t<_is_integer<T>, int> = 0
#else
  #define INLINE_V inline
  #define REGISTER_V
  #define CPP14CONSTEXPR constexpr
  #define CPP14ENABLE_IF ,enable_if_t<_is_integer<T>, int> = 0
#endif

#if !defined(_WIN32) && !defined(LOCK_GETCHAR)
  #define getchar getchar_unlocked
#endif

#define il inline
#define mkp make_pair
#define fi first
#define se second
#define For(i,j,k) for(REGISTER_V int i=(j);i<=(k);++i) // NOLINT
#define ForDown(i,j,k) for(REGISTER_V int i=(j);i>=(k);--i) // NOLINT
#define pb push_back
#define eb emplace_back
#ifndef ONLINE_JUDGE
#define FileIO(filename) freopen(filename".in","r",stdin);freopen(filename".out","w",stdout)
#else
#define FileIO(filename)
#endif

using ll = long long;
// using lll = __int128_t;
using uint = unsigned int;
using ull = unsigned long long;
// using ulll = __uint128_t;
using db = double;
using ldb = long double;
using pii = pair<int, int>;
using pll = pair<ll, ll>;

#if __cplusplus >= 201400
  template <class T> INLINE_V constexpr bool _is_integer = numeric_limits<T>::is_integer;
  // template <> INLINE_V constexpr bool _is_integer<__int128> = true;
  // template <> INLINE_V constexpr bool _is_integer<__uint128_t> = true;
  template <> INLINE_V constexpr bool _is_integer<bool> = false;
  template <> INLINE_V constexpr bool _is_integer<char> = false;
  template <class T CPP14ENABLE_IF>
    INLINE_V constexpr T INF = numeric_limits<T>::max() >> 1;
#endif

template<typename T> constexpr il T sq(const T & x){return x*x;}
template<typename T> CPP14CONSTEXPR il void cmin(T & x, const T &y){x=min(x,y);}
template<typename T> CPP14CONSTEXPR il void cmax(T & x, const T &y){x=max(x,y);}
template<typename T> CPP14CONSTEXPR il T qpow(T x, ull y, T mod){T ans=1;x%=mod;while(y){if(y&1)(ans*=x)%=mod;(x*=x)%=mod;y>>=1;}return ans;}
template<typename T> CPP14CONSTEXPR il T qpow(T x, ull y){T ans=1;while(y){if(y&1)ans*=x;x*=x;y>>=1;}return ans;}
template<typename T CPP14ENABLE_IF> il void read(T &x){ x=0;int f=1;int c=getchar();while(!isdigit(c)){if(c=='-')f=-1;c=getchar();}while(isdigit(c)){x=x*10+c-'0';c=getchar();}x*=f;}
template<typename T, typename ... Args> il void read(T &x, Args &... y){ read(x);read(y...); }

// File head end
// clang-format on

#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>

using namespace __gnu_pbds;
using bst = __gnu_pbds::tree<pair<ll, int>, null_type, less<>, rb_tree_tag,
                             tree_order_statistics_node_update>;

namespace {
constexpr ll MAXN = 1e6 + 5;
int n, E, id[MAXN];
pii a[MAXN];
ll sum[MAXN];
class PrioQueue {
  struct Node {
    ll val, tag;
    int lc, rc, fa;
    Node() : val(0), tag(0), lc(0), rc(0), fa(0) {}
  } static T[MAXN * 4];
#define lc(p) (T[p].lc)
#define rc(p) (T[p].rc)
#define fa(p) (T[p].fa)
  static mt19937 rnd;
  static int cnt;
  int rt;

public:
  PrioQueue() : rt(0) {}
  il void pd(int p) {
    T[lc(p)].val += T[p].tag, T[lc(p)].tag += T[p].tag;
    T[rc(p)].val += T[p].tag, T[rc(p)].tag += T[p].tag;
  }
  int merge(int p, int q) {
    if (!p || !q)
      return p | q;
    pd(p), pd(q);
    if (T[p].val < T[q].val) {
      int &ch = (rnd() & 1) ? lc(p) : rc(p);
      return ch = merge(ch, q), fa(ch) = p, p;
    } else {
      int &ch = (rnd() & 1) ? lc(q) : rc(q);
      return ch = merge(ch, p), fa(ch) = q, q;
    }
  }
  il void erase(int p) {
    int f = fa(p);
    pd(f), pd(p);
    if (!f)
      rt = merge(lc(p), rc(p)), fa(rt) = 0;
    else if (lc(f) == p)
      lc(f) = merge(lc(p), rc(p)), fa(lc(f)) = f;
    else
      rc(f) = merge(lc(p), rc(p)), fa(rc(f)) = f;
  }
  il void add(int val) {
    if (rt)
      T[rt].val += val, T[rt].tag += val;
  }
  il int insert(ll val) {
    int p = ++cnt;
    T[p].val = val;
    return rt = merge(rt, p), p;
  }
  il ll top() const { return T[rt].val; }
  il bool empty() const { return !rt; }
};

PrioQueue::Node PrioQueue::T[MAXN * 4];
mt19937 PrioQueue::rnd = mt19937(random_device{}());
int PrioQueue::cnt = 0;

PrioQueue pq;
bst st;
ll Cur = 0;
il bool ok(int pos) {
  return pq.empty() ||
         (pq.top() >= a[pos].fi - a[pos].se && (E - a[pos].fi) >= Cur);
}
il void ins(int pos) {
  if (a[pos].se < a[pos].fi) {
    Cur += a[pos].fi - a[pos].se;
    pq.add(a[pos].se - a[pos].fi);
  }
  id[pos] = pq.insert(E - a[pos].fi);
  st.insert(mkp(sum[pos], pos));
}
il void del(int pos) {
  if (a[pos].se < a[pos].fi) {
    Cur -= a[pos].fi - a[pos].se;
    pq.add(a[pos].fi - a[pos].se);
  }
  pq.erase(id[pos]);
  st.erase(mkp(sum[pos], pos));
}

il void solver_main() {
  read(n, E);
  For(i, 1, n) read(a[i].fi);
  For(i, 1, n) read(a[i].se);
  For(i, 1, n) sum[i] = sum[i - 1] + a[i].se - a[i].fi;

  ll cnt = 0;
  for (int i = 1, j = 0; i <= n; i++) {
    while (j + 1 <= n && ok(j + 1))
      ins(++j);
    cnt += st.size() - st.order_of_key(mkp(sum[i - 1], 0));
    // cerr << i << ' ' << j << '\n';
    del(i);
  }
  cout << cnt << '\n';
}
} // namespace

signed main() { return solver_main(), 0; }