#include <iostream>
#include <algorithm>
#define MAX 200005
using namespace std;

typedef long long ll;
ll N, bit[MAX] = {};

void update(ll x, ll delta) {
    for (;x <= N+1; x += x&-x) bit[x] += delta;
}

ll query(ll x) {
    ll sum = 0;
    for (;x > 0; x -= x&-x) sum += bit[x];
    return sum;
}

int main() {
    ll K, a[MAX], b[MAX], c[MAX], i;
    cin >> N >> K;
    b[0] = 0, c[0] = 0;
    for (i = 0; i < N; i++) cin >> a[i], a[i] -= K, b[i+1] = b[i]+a[i], c[i+1] = b[i+1];
    sort(c, c+N+1);

    ll res = 0;
    for (i = 0; i <= N; i++) {
        ll ind = lower_bound(c, c+N+1, b[i])-c+1;
        res += query(ind);
        update(ind, 1);
    }
    cout << res << '\n';
}