#include <cstdlib>
#include <cmath>
#include <climits>
#include <cfloat>
#include <map>
#include <set>
#include <iostream>
#include <string>
#include <vector>
#include <algorithm>
#include <sstream>
#include <complex>
#include <stack>
#include <queue>
#include <cstdio>
#include <cstring>
#include <iterator>
#include <bitset>
#include <unordered_set>
#include <unordered_map>
#include <fstream>
#include <iomanip>
#include <cassert>
#include <utility>
#include <memory>
#include <functional>
#include <deque>
#include <cctype>
#include <ctime>
#include <numeric>
#include <list>
#include <iomanip>

#if __cplusplus >= 201103L
#include <array>
#include <tuple>
#include <initializer_list>
#include <forward_list>

#define cauto const auto&
#else

#endif

using namespace std;


typedef long long ll;
typedef pair<int,int> pii;
typedef pair<ll,ll> pll;

typedef vector<int> vint;
typedef vector<vector<int> > vvint;
typedef vector<long long> vll;
typedef vector<vector<long long> > vvll;

#define VV(T) vector<vector< T > >

template <class T>
void initvv(vector<vector<T> > &v, int a, int b, const T &t = T()){
    v.assign(a, vector<T>(b, t));
}

template <class F, class T>
void convert(const F &f, T &t){
    stringstream ss;
    ss << f;
    ss >> t;
}

#define GET_MACRO(_1, _2, _3, NAME, ...) NAME
#define _rep(i,n) _rep2((i),0,(n))
#define _rep2(i,a,b) for(int i=(a);i<(b);++i)
#define rep(...) GET_MACRO(__VA_ARGS__, _rep2, _rep)(__VA_ARGS__)
#define ALL(v) (v).begin(),(v).end()
#define PB push_back
#define fi first
#define se second
#define mkp make_pair
#define DEBUG
#ifdef DEBUG
#define dump(x)  cout << #x << " = " << (x) << endl;
#define debug(x) cout << #x << " = " << (x) << " (L" << __LINE__ << ")" << " " << __FILE__ << endl;
#else
#define dump(x) 
#define debug(x) 
#endif

#define MOD 1000000007LL
#define EPS 1e-8
#define INF 0x3f3f3f3f
#define INFL 0x3f3f3f3f3f3f3f3fLL
#define maxs(x,y) x=max(x,y)
#define mins(x,y) x=min(x,y)


template <class Tp>
class fenwick_tree{
	std::vector<Tp> bit;
public:
	fenwick_tree(){}
	explicit fenwick_tree(std::size_t n) : bit(n + 1) {}
	Tp sum(std::size_t i) const{
		i++;
		assert(i); // 0 ha dame zettai !
		Tp s = 0;
		while(i){
			s += bit[i];
			i -= i & -i;
		}
		return s;
	}
	void add(std::size_t i, Tp x){
		i++;
		assert(i); // 0 ha dame zettai !
		while(i < bit.size()){
			bit[i] += x;
			i += i & -i;
		}
	}
	void clear(){
		bit.clear();
	}
	void assign(std::size_t n){
		bit.assign(n + 1, Tp());
	}
	void swap(fenwick_tree &f){
		bit.swap(f.bit);
	}
};


void mainmain(){
	int n;
	cin>>n;
	ll K;
	cin>>K;
	vll v(n);
	rep(i,n){
		cin>>v[i];
		v[i] -= K;
	}
	vll sum(n);
	rep(i,n){
		sum[i] = v[i];
		if(i) sum[i] += sum[i-1];
	}
	vector<pll> w(n);
	rep(i,n){
		w[i] = pll(sum[i], i);
	}
	sort(ALL(w));
	fenwick_tree<int> bit(n+1);
	rep(i,n) bit.add(i,1);
	ll ans = 0;
	ll s = 0;
	rep(i,n){
		// cout<<w[i].fi<<" "<<w[i].se<<endl;
	}
	// cout<<endl;
	rep(i,n){
		// cout<<w.size()<<endl;
		int ind = lower_bound(ALL(w), pll(s, -1)) - w.begin();
		// cout<<ind<<" "<<w[ind].fi<<" "<<w[ind].se<<endl;
		// cout<<s<<" "<<bit.sum(n)<<" "<<(ind==0?0:bit.sum(ind-1))<<endl;
		ans += bit.sum(n-1) - (ind==0?0:bit.sum(ind-1));
		int ind2 = lower_bound(ALL(w), pll(sum[i], i)) - w.begin();
		// cout<<"ind "<<ind2<<" "<<sum[i]<<" "<<i<<endl;
		bit.add(ind2, -1);
		s += v[i];
	}
	// cout<<endl;
	rep(i,n){
		int ss = 0;
		int cnt = 0;
		rep(j,i,n){
			ss += v[j]+K;
			if(ss >= K*(j-i+1)) cnt++;
		}
		// cout<<i<<" "<<cnt<<endl;
	}
	// cout<<endl;
	cout<<ans<<endl;
}


signed main() {
    ios_base::sync_with_stdio(false);
    cin.tie(0);
    cout<<fixed<<setprecision(20);
    mainmain();
}

Measured memory_bytes: 7296