#include<bits/stdc++.h>
using namespace std;

const int MAX = 200005;
long long A[MAX], B[MAX];

int N;
long long BIT[MAX];
void add(int a, long long w) {
    for (int x = a; x <= N+1; x += x & -x) BIT[x] += w;
}
long long sum(int a) {
    long long ret = 0;
    for (int x = a; x > 0; x -= x & -x) ret += BIT[x];
    return ret;
}

int main() {
    int K;
    long long a;
    scanf("%d %d", &N, &K);
    A[0] = B[0] = 0;
    for (int i = 1; i <= N; i++) {
        scanf("%lld", &a);
        A[i] = A[i-1] + a - K;
        B[i] = A[i]; 
    }
    sort(B, B+N+1);
    long long ans = 0;
    for (int i = 0; i <= N; i++) {
        int p = distance(B, lower_bound(B, B+N+1, A[i]));
        ans += sum(p+1);
        add(p+1, 1ll);
    }
    printf("%lld\n", ans);
    return 0;
}