#include <bits/stdc++.h> // ver2.7.1
#define int long long
#define endl "\n" // fflush(stdout);
#define ALL(v) (v).begin(),(v).end()
#define Vi vector<int>
#define VVi vector<Vi>
#define VVVi vector<VVi>
#define Vm vector<mint>
#define Vs vector<string>
#define Vd vector<double>
#define Vc vector<char>
#define Pii pair<int,int>
#define Pdd pair<double,double>
#define VPii vector<Pii>
#define Tiii tuple<int,int,int>
#define VTiii vector<Tiii>
#define PQi priority_queue<int>
#define PQir priority_queue<int,vector<int>,greater<int>>
#define pb push_back
#define mp make_pair
#define mt make_tuple
#define itos to_string
#define stoi stoll
#define FI first
#define SE second
#define cYES cout<<"YES"<<endl
#define cNO cout<<"NO"<<endl
#define cYes cout<<"Yes"<<endl
#define cNo cout<<"No"<<endl
#define cyes cout<<"yes"<<endl
#define cno cout<<"no"<<endl
#define sortr(v) sort(v,greater<>())
#define rep(i,a,b) for(int i=a;i<b;i++)
#define repeq(i,a,b) for(int i=a;i<=b;i++)
#define repreq(i,a,b) for(int i=a;i>=b;i--)
#define dem(a,b) ((a+b-1)/(b))
#define INF 3000000000000000000 // 3.0*10^18
#define MAX LLONG_MAX
#define PI acos(-1.0L)
//int MOD = 998244353; // case
const int MOD = 1000000007; // 10^9 + 7
const double EPS = 1e-10;

using namespace std;

struct mint{int x;mint(int x=0):x((x%MOD+MOD)%MOD){}
mint operator-()const{return mint(-x);}
mint& operator+=(const mint a){if((x+=a.x)>=MOD)x-=MOD;return*this;}
mint& operator-=(const mint a){if((x+=MOD-a.x)>=MOD)x-=MOD;return*this;}
mint& operator*=(const mint a){(x*=a.x)%=MOD;return*this;}
mint operator+(const mint a)const{return mint(*this)+=a;}
mint operator-(const mint a)const{return mint(*this)-=a;}
mint operator*(const mint a)const{return mint(*this)*=a;}
mint pow(int t)const{if(!t)return 1;mint a=pow(t>>1);a*=a;if(t&1)a*=*this;return a;}
mint inv()const{return pow(MOD-2);}
mint& operator/=(const mint a){return*this*=a.inv();}
mint operator/(const mint a)const{return mint(*this)/=a;}};
istream& operator>>(istream& is, const mint& a) {return is >> a.x;}
ostream& operator<<(ostream& os, const mint& a) {return os << a.x;}

/* debug */
template <typename T> // vector
ostream& operator<<(ostream& os,const vector<T> &V){int N=V.size();
if(N==0){os<<'.';return os;}rep(i,0,N-1){os<<V[i]<<' ';}os<<V[N-1];return os;}
template <typename T> // vector vector
ostream& operator<<(ostream& os,const vector<vector<T>> &V){
int N=V.size();rep(i,0,N-1)cout<<V[i]<<endl;cout<<V[N-1];return os;}
template <typename T,typename S> // pair
ostream& operator<<(ostream& os, pair<T,S> const&P){os<<P.FI<<' '<<P.SE;return os;}
template <typename T> // set
ostream& operator<<(ostream& os,set<T> &S){auto it=S.begin();while(it!=S.end()){
os<<*it;if(next(it,1)!=S.end())os<<' ';it++;};return os;}
template <typename T> // deque
ostream& operator<<(ostream& os, deque<T> &q){for(auto it=q.begin();it<q.end();it++){
os<<*it;if(it+1!=q.end())os<<" ";}return os;}

/* useful */
template<typename T>void Vin(vector<T> &v){int n=v.size();rep(i,0,n)cin>>v[i];}
int gcd(int a,int b){return b?gcd(b,a%b):a;}
int lcm(int a,int b){return a/gcd(a,b)*b;}
int mypow(int x, int n, int m){
if(n==0)return 1;if(n%2==0)return mypow(x*x%m,n/2,m);else return x*mypow(x,n-1,m)%m;}
int scomb(int n, int r){if(r<0||r>n)return 0;if((n-r)<r)r=n-r; // nCr
int a=1;for(int i=n;i>n-r;--i){a=a*i;}for(int i=1;i<r+1;++i){a=a/i;}return a;}
Vi vis(Vi &v){Vi S(v.size()+1);rep(i,1,S.size())S[i]+=v[i-1]+S[i-1];return S;}
int digitsum(int n){int ret=0; while(n>0){ret+=n%10;n/=10;}return ret;}
int digit(int k,int i){string s = itos(k);return s[s.size()-i]-'0';} // i桁目の数字
template<typename T>void press(T &v){v.erase(unique(ALL(v)),v.end());} // 圧縮
Vi zip(Vi b){int Z=b.size(); // 座標圧縮
Pii p[Z+10];int a=b.size();Vi l(a);for(int i=0;i<a;i++)
p[i]=mp(b[i],i);sort(p,p+a);int w=0;for(int i=0;i<a;i++)
{if(i&&p[i].first!=p[i-1].first)w++;l[p[i].second]=w;}return l;}
Vi nibe2V(){Vi a(63);int q = 1;rep(i,0,63){a[i]=q;q*=2;}return a;}
Vi nibe = nibe2V(); // 2^n
int modiv(int a,int b){return a*mypow(b,MOD-2,MOD)%MOD;} // a÷b(%MOD)
int SMALLER(Vi &a,int x){return lower_bound(a.begin(),a.end(),x)-a.begin();}
int orSMALLER(Vi &a,int x){return upper_bound(a.begin(),a.end(),x)-a.begin();}
int BIGGER(Vi &a,int x){return a.size()-orSMALLER(a,x);}
int orBIGGER(Vi &a,int x){return a.size()-SMALLER(a,x);}
int COUNT(Vi &a,int x) {return upper_bound(ALL(a),x)-lower_bound(ALL(a),x);}
int maxind(Vi &a){return max_element(ALL(a))-a.begin();}
int minind(Vi &a){return min_element(ALL(a))-a.begin();}
Vi stpowV(){Vi a(300005);a[0]=1;repeq(i,1,300004)a[i]=a[i-1]*i%MOD;return a;}
Vi stpow = stpowV(); // 階乗配列(%MOD)

/****************************** START ******************************/

int leaf(int n) {
  int a=1;
  while(a<n) a *= 2;
  return a;
}

struct PQ2 {
  
  /*使い方まとめ*/
  
  /*
  
  PQ2 myque(n)  //宣言 nは入るであろう最大のint以上
  myque.insert(k) //kを挿入
  myque.erase(k) //kを削除
  myque.count(k) //kの個数を返す
  myque.rsum(l,r) //lからrまでの個数を返す
  myque.rank(i)  //i番目に小さい要素を返す(0-index)
  myque.rankr(i) //i番目に大きい要素を返す(0-index)
  myque.smaller(k) //kより小さい要素の最大のものを返す(なければ-1を返す)
  myque.bigger(k) //kより大きい要素の最小のものを返す(なければ-1を返す)
  
  ※※※　　負のintは入りません　　※※※
  */
  vector<int> value;
  
  PQ2(int n) : value(0) {
    int ct = leaf(n)*2-1;
    rep(i,0,ct) value.pb(0); // 全部0
  }
  
  void update(int i, int x) {
    int N = (value.size()+1)/2;
    i += N - 1;
    value[i] += x;
    while (i > 0) {
      i = (i - 1) / 2;
      value[i] = value[i * 2 + 1]+value[i * 2 + 2];
    }
    return;
  }
  
  int at(int i) { //i番目の要素にアクセス
    int N = (value.size()+1)/2;
    return value[i-1+N];
  }
  
  int count(int i) { //i番目の要素にアクセス
    int N = (value.size()+1)/2;
    return value[i-1+N];
  }
  
  int RSQ2(int a, int b, int k, int l, int r) {
    // [a, b) の区間に対するクエリについて
    // ノード k （区間 [l, r) 担当）が答える
    if (r <= a || b <= l) return 0; // 区間が被らない場合は0を返す
    if (a <= l && r <= b)
      return value[k]; // ノード k の担当範囲がクエリ区間 [a, b)に完全に含まれる
    else {
      int c1 = RSQ2(a, b, 2 * k + 1, l, (l + r) / 2); // 左の子に値を聞く
      int c2 = RSQ2(a, b, 2 * k + 2, (l + r) / 2, r); // 右の子に値を聞く
      return c1+c2; // 左右の子の値の sum を取る
    }
  }
  
  int rsum(int a,int b) {
    int N = (value.size()+1)/2;
    return RSQ2(a,b+1,0,0,N);
  }
  
  void insert(int a) {
    update(a,1);
    return;
  }
  
  int rank(int i) {
    i++;
    int L=0,R=(value.size()+1)/2-1;
    int mid = (L+R)/2;
    int eq,minus,ct=0;
    while(ct<30){
      eq = rsum(0,mid);
      minus = rsum(0,mid-1);
      
      if(eq == i && minus <= i-1) {
        break;
      }
      if(eq > i) {
        R = mid;
      }
      if(eq == i && minus == i) {
        R = mid;
      }
      if(eq < i) {
        L = mid;
      }
      mid = (L+R)/2;
      ct++;
    }
    if(ct==30) mid++;
    return mid;
  }
  
  int rankr(int i) {
    return rank(value[0]-1-i);
  }
  
  void erase(int a) {
    update(a,-1);
    return;
  }
  
  int smaller(int k) {
    int L=0,R=k-1;
    if(rsum(0,k-1)==0) return -1;
    int mid = (L+R)/2;
    while(L<R) {
      if(rsum(mid,R) == 0){
        R = mid-1;
      }
      else {
        L = mid;
      }
      mid = (L+R+1)/2;
    }
    return mid;
  }
  
  int bigger(int k) {
    int L=k+1,R=(value.size()+1)/2-1;
    if(rsum(L,R)==0) return -1;
    int mid = (L+R)/2;
    while(L<R) {
      if(rsum(L,mid) == 0){
        L = mid+1;
      }
      else {
        R = mid;
      }
      mid = (L+R)/2;
    }
    return mid;
  }
  
};

signed main() {
  cin.tie(0);cout.tie(0);ios::sync_with_stdio(false);cout<<fixed<<setprecision(12);
  int n,K;
  cin >> n >> K;
  Vi a(n);
  rep(i,0,n){
    cin >> a[i];
    a[i] -= K;
  }
  int ans = 0;
  Vi S = vis(a);
  S = zip(S);
  //cout << S << endl;
  PQ2 q(200010);
  repreq(i,S.size()-1,0){
    ans += q.rsum(S[i],200005);
    q.insert(S[i]);
  }
  cout << ans << endl;
  
  return 0;
}

Measured memory_bytes: 18016