#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace std;
using namespace __gnu_pbds;
#define ll long long
typedef tree<pair<ll,ll>, null_type,
less<pair<ll,ll>>, rb_tree_tag,
tree_order_statistics_node_update>
ordered_set_pair;
const int MAXN = 1e5 + 11;
int n;
ll a[MAXN], k;
ordered_set_pair f;
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
cin >> n >> k;
for(int i = 1; i <= n; ++i) {
cin >> a[i];
a[i] -= k;
}
ll res = 0;
for(int i = 1; i <= n; ++i) {
a[i] += a[i - 1];
if(a[i] >= 0) ++res;
res += ((int) f.size()) - f.order_of_key({0, -1e9});
f.insert({a[i], i});
}
cout << res;
return 0;
}
I2luY2x1ZGUgPGJpdHMvc3RkYysrLmg+CiNpbmNsdWRlIDxleHQvcGJfZHMvYXNzb2NfY29udGFpbmVyLmhwcD4gIAojaW5jbHVkZSA8ZXh0L3BiX2RzL3RyZWVfcG9saWN5LmhwcD4gCgp1c2luZyBuYW1lc3BhY2Ugc3RkOwp1c2luZyBuYW1lc3BhY2UgX19nbnVfcGJkczsgCiNkZWZpbmUgbGwgbG9uZyBsb25nCgoKdHlwZWRlZiB0cmVlPHBhaXI8bGwsbGw+LCBudWxsX3R5cGUsICAKICAgICAgICBsZXNzPHBhaXI8bGwsbGw+PiwgcmJfdHJlZV90YWcsIAogICAgICAgIHRyZWVfb3JkZXJfc3RhdGlzdGljc19ub2RlX3VwZGF0ZT4gCiAgICAgICAgb3JkZXJlZF9zZXRfcGFpcjsgCgpjb25zdCBpbnQgTUFYTiA9IDFlNSArIDExOwppbnQgbjsKbGwgYVtNQVhOXSwgazsKb3JkZXJlZF9zZXRfcGFpciBmOwoKaW50IG1haW4oKSB7Cglpb3NfYmFzZTo6c3luY193aXRoX3N0ZGlvKGZhbHNlKTsKCWNpbi50aWUoTlVMTCk7CgljaW4gPj4gbiA+PiBrOwoJCglmb3IoaW50IGkgPSAxOyBpIDw9IG47ICsraSkgewoJCWNpbiA+PiBhW2ldOwoJCWFbaV0gLT0gazsKCX0KCQoJbGwgcmVzID0gMDsKCWZvcihpbnQgaSA9IDE7IGkgPD0gbjsgKytpKSB7CgkJYVtpXSArPSBhW2kgLSAxXTsKCQlpZihhW2ldID49IDApICsrcmVzOwoJCXJlcyArPSAoKGludCkgZi5zaXplKCkpIC0gZi5vcmRlcl9vZl9rZXkoezAsIC0xZTl9KTsKCQlmLmluc2VydCh7YVtpXSwgaX0pOwoJfQoJCgljb3V0IDw8IHJlczsKCXJldHVybiAwOwp9Cg==