// template version 1.4
// {{{ define basic macro
using namespace std;
#include <iostream>
#include <bits/stdc++.h>
#define _overload3(_1,_2,_3,name,...) name
#define _rep(i,n) repi(i,0,n)
#define repi(i,a,b) for(int i=(int)(a);i<(int)(b);++i)
#define rep(...) _overload3(__VA_ARGS__,repi,_rep,)(__VA_ARGS__)
#define _rrep(i,n) rrepi(i,0,n)
#define rrepi(i,a,b) for(int i=(int)(b-1);i>=(int)(a);--i)
#define rrep(...) _overload3(__VA_ARGS__,rrepi,_rrep,)(__VA_ARGS__)
#define all(x) (x).begin(),(x).end()
#define sum(v) accumulate(all(v), 0LL)
#define sz(x) ((int)(x).size())
#define pb(a) push_back(a)
#define mp(a, b) make_pair(a, b)
#define uni(x) sort(all(x));x.erase(unique(all(x)),x.end())
#define ten(n) ((int)1e##n)
template<class T, size_t N> size_t sza(const T (&array)[N]) { return N; }
template<class T> inline void chmax(T &a, const T &b) { if(a < b) a = b; }
template<class T> inline void chmin(T &a, const T &b) { if(a > b) a = b; }
template<class T=int> T in() {T x; cin>>x; return (x);}

struct Fast {
  Fast(){
    std::cin.tie(0);
    ios::sync_with_stdio(false);
  }
} fast;

// dump macro
#ifdef PCM
  #include "dump.hpp"
#else
  #define dump(...) 42
  #define dump_1d(...) 42
  #define dump_2d(...) 42
#endif

typedef long long ll;
typedef vector<int> vi;
typedef vector<vi> vvi;
typedef long double ld;
typedef pair<int,int> pii;
typedef tuple<int,int,int> iii;
template<typename T> using PQ = priority_queue<T, vector<T>, greater<T>>;
int dx[]={1, -1, 0, 0};
int dy[]={0, 0, 1, -1};
#define fi first
#define se second

// }}}
// varible setting{{{

#define infile "../test/sample-1.in"
#define int long long
#define INF 1000000000000000000LL
// #define INF 2147483647
#define MOD 1000000007LL

// }}}

// acumulative sum vector {{{
template<typename T=int>
struct asvector : public vector<T> {
  using vector<T>::vector;
  vector<T> cum; //accumulative sum
  bool is_accumulated = false;

  public:
  T rsum(int l, int r) {  // return sum of [l, r] of data.
    if (!is_accumulated)
      _accumulate();
    l = std::max(0LL, l);
    r = std::min(r, sz(cum)-1);
    return _calc_rangesum(l, r);
  }

  T rsum(int r) {  // return sum of [0, r] of data.
    if (!is_accumulated)
      _accumulate();
    int l = 0;
    r = std::min(r, sz(cum)-1);
    return _calc_rangesum(l, r);
  }

  void _accumulate(){
    cum = vector<T>(*this);
    for(T i=1; i<sz(cum); i++){
      cum[i] = cum[i-1] + (*this)[i];
    }
    is_accumulated = true;
  }

  void push_back(T x){
    (*this).emplace_back(x);
    is_accumulated = false;
  }

  private:
  T _calc_rangesum(int l, int r) {
    if (l > r)
      return 0;
    else
      return cum[r] - (l-1>=0 ? cum[l-1] : 0);
  }
};
//}}}

template<typename T=int>
struct BIT {
  public:
    vector<T> data;  // 1-index
    int size;

    // constructor
    BIT(vector<T> v){  // v: 0-index vector
      data = vector<T>(sz(v)+1);
      size = sz(data);
      rep(i, 1, sz(v)) add(i+1, v[i]);
    }
    BIT(int n){
      data = vector<T>(n+1);
      size = sz(data);
    }

    T cum(int idx){
      T res = 0;
      for (int i = idx; i > 0; i -= i&-i) res += data[i];
      return res;
    }

    void add(int idx, T x){
      for (int i = idx; i <= size; i += i&-i){
        data[i] += x;
      }
    }

  private:
};

int solve(){
  int n,k;cin>>n>>k;
  asvector<int> a(n);
  rep(i, n){
    cin>>a[i];
    a[i] -= k;
  }
  dump(a);
  a._accumulate();
  dump(a.cum);

  vector<ll> unzipper;
  a.cum.insert(a.cum.begin(), {0});
  unzipper = vector<ll>(a.cum);
  uni(unzipper);
  dump(unzipper);
  map<int, int> zipper;
  rep(i, sz(unzipper)) zipper[unzipper[i]] = i;
  vi zipped;
  rep(i, sz(a.cum)) zipped.pb(zipper[a.cum[i]]+1);
  dump(zipped);

  BIT<int> bit(sz(unzipper));

  int res = 0;
  rep(i, sz(zipped)){
    dump(i, bit.cum(zipped[i]));
    res += bit.cum(zipped[i]);
    bit.add(zipped[i], 1);
  }

  cout << res << endl;

  return 0;
}

signed main() { //{{{
#ifdef INPUT_FROM_FILE
  std::ifstream in(infile);
  std::cin.rdbuf(in.rdbuf());
#endif
  solve();
  return 0;
} //}}}


Measured memory_bytes: 22244