#include <cstdio>
#include <iostream>
#include <algorithm>
using namespace std;

typedef long long LL;
const int N = 2e5 + 5;

LL pre[N], tab[N];

int bit[N];

inline void add(int x) {
  for (; x < N; x += x & (- x)) bit[x] ++;
}

inline int sum(int x) {
  int ret = 0;
  for (; x > 0; x -= x & (- x)) ret += bit[x];
  return ret;
}

int main() {
  int n, k;
  scanf("%d%d", &n, &k);
  for (int i = 1; i <= n; i ++) {
    scanf("%lld", &pre[i]);
    pre[i] -= k;
    pre[i] += pre[i - 1];
    tab[i] = pre[i];
  }
  sort(tab, tab + n + 1);
  LL ans = 0;
  for (int i = 0, p; i <= n; i ++) {
    p = lower_bound(tab, tab + n + 1, pre[i]) - tab + 1;
    ans += sum(p);
    add(p);
  }
  printf("%lld\n", ans);
  return 0;
}
