/*Bismillahir Rahmanir Rahim*///{
#include <bits/stdc++.h>
using namespace std;
using ll = long long; using ull = unsigned long long; using ld = long double;
const ll llinf = (1ll<<61)-1;
const double eps = 1e-6, ldeps = 1e-9;
struct Dbg {
static constexpr auto &os = cout;   // replace by cerr in interactive.
template<class C> static auto dud(C *x)->decltype(os << *x, 0);
template<class C> static char dud(...);
template<class C> typename enable_if<sizeof dud<C>(0)!=1, Dbg&>::type operator<<(const C &x) { os << x; return *this; }
template<class C> Dbg &dump(C b, C e) {
    *this << "\n[";
    int cur = 0;
    for (C i = b; i!=e and cur<26; i++, cur++) *this << ", "+2*(i==b) << *i;
    return *this << ']';
}
template<class C> typename enable_if<sizeof dud<C>(0)==1, Dbg&>::type operator<<(const C &x) {
    return dump(begin(x), end(x));
}
template<class C, size_t X> typename enable_if<sizeof(C)!=1, Dbg&>::type operator <<(C (&x)[X]) {
    return dump(begin(x), end(x));
}
template<class B, class C> Dbg &operator <<(const pair<B, C> &x) {
    return *this << '{' << x.first << ", " << x.second << '}';
}
template<class C, size_t Y> struct TP {
    void operator()(Dbg& os, const C &t) { TP<C, Y-1>()(os, t); os << ", " << get<Y-1>(t); }
};
template<class C> struct TP<C, 1> { void operator()(Dbg& os, const C &t) { os << get<0>(t); } };
template<class... C> Dbg& operator<<(const tuple<C...> &t) {
    os << '{', TP<decltype(t), sizeof...(C)>()(*this, t); return *this << '}';
}
Dbg &operator<<(ostream&(*x)(std::ostream&)) { os << x; return *this; }
} dbg;
void err(istringstream *iss) { delete iss; }
template<class C, class... Args> void err(istringstream *iss, const C &val, const Args &... args) {
    string name; *iss >> name; if (name.back()==',') name.pop_back();
    dbg << name << " = " << val << "; ", err(iss, args ...);
}
#define bug(args...) dbg << __LINE__ << ": ", err(new istringstream(string(#args)), args), dbg << endl
#define sl(a) int(strlen(a))
#define sz(a) int(a.size())
int T, Q, cn;//}
const int inf = 1000000007, mxn = 200005;

#include <ext/pb_ds/assoc_container.hpp>
using namespace __gnu_pbds;

template<class key, class cmp = less<key>>
using ordered_set = tree<key, null_type, cmp, rb_tree_tag, tree_order_statistics_node_update>;

int n, K, a[mxn];
ll cs[mxn];

signed main() { ios::sync_with_stdio(0); cin.tie(NULL); cout.precision(11);
/*
Traverse from left to right: when at 1, we need to check if cs[1]-cs[0]>=K, when at 2, check if cs[2]-cs[1]>=K and if
cs[2]-cs[0]>=2*K. ==> going one element right, we need to increase all previous elements' checking by K, we can adjust
the new inserted element to that, i.e. we keep a ordered_multiset and query of how many elements <= cs[i]-x, we increase
x by K every time we move to right, x = K at 1, when going from 1 to 2, x becomes 2K and we insert cs[1]-K, as:
cs[1]-k <= cs[2]-2k  ==>  cs[1]<=cs[2]-k which is exactly what we need.
*/
    cin >> n >> K;
    for (int i = 1; i <= n; i++) {
        cin >> a[i];
        cs[i] = cs[i-1]+a[i];
    }
    ll x = 0, ans = 0;
    ordered_set<pair<ll, int> > ost;
    ost.insert({0, 0});
    for (int i = 1; i <= n; i++) {
        x += K;
        ans += ost.order_of_key({cs[i]-x, inf});
        ost.insert({cs[i]-x, i});
    }
    cout << ans << '\n';
}

Measured memory_bytes: 15104