#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
typedef pair<ll,ll> P;
typedef pair<int,int> Pi;
#define rep(i,n) for(ll i=0;i<n;i++)
#define FOR(i,a,b) for(ll i=a;i<b;i++)
#define fi first
#define se second
#define endl "\n"

template<typename T> inline bool chmax(T &a, T b){if(a<b){a=b;return true;}return false;}
template<typename T> inline bool chmin(T &a, T b){if(a>b){a=b;return true;}return false;}
template<typename T> ostream& operator<<(ostream& s,const complex<T>& d) {return s<<"("<<d.real()<<", "<<d.imag()<< ")";}
template<typename T1, typename T2> ostream& operator<<(ostream& s,const pair<T1,T2>& d) {return s<<"("<<d.first<<", "<<d.second<<")";}
template<typename T> ostream& operator<<(ostream& s, const vector<T>& d){int len=d.size();rep(i,len){s<<d[i];if(i<len-1) s<<" ";}return s;}
template<typename T> ostream& operator<<(ostream& s,const vector<vector<T>>& d){int len=d.size();rep(i,len){s<<d[i]<<endl;}return s;}
template<typename T> ostream& operator<<(ostream& s,const set<T>& v){s<<"{ ";for(auto itr=v.begin();itr!=v.end();++itr) {if (itr!=v.begin()) {s<< ", ";}s<<(*itr);}s<<" }";return s;}
template<typename T1, typename T2> ostream& operator<<(ostream& s,const map<T1,T2>& m){s<<"{"<<endl;for(auto itr=m.begin();itr!=m.end();++itr){s<<" "<<(*itr).first<<" : "<<(*itr).second<<endl;}s<<"}"<<endl;return s;}

const ll mod=1e9+7;
const ll inf=1e17;
const int INF=1e9;
const double PI=acos(-1);
const double EPS=1e-10;

template<typename Monoid,typename F>
struct SegmentTree{
	int sz;
	vector<Monoid> node;
	const F op;//演算
	const Monoid e;//単位元
	SegmentTree(int n,const F op,const Monoid &e):op(op),e(e){
		sz=1;
		while(sz<n) sz*=2;
		node.assign(2*sz,e);
	}
	void build(const vector<Monoid> &v){
		int n=v.size();
		for(int i=0;i<n;i++) node[i+sz-1]=v[i];
		for(int i=sz-2;i>=0;i--) node[i]=op(node[2*i+1],node[2*i+2]);
	}
	void update(int k,const Monoid &x){
		k+=sz-1;
		node[k]=x;
		while(k>0){
			k=(k-1)/2;
			node[k]=op(node[2*k+1],node[2*k+2]);
		}
	}
	Monoid query(int a,int b,int k=0,int l=0,int r=-1){
		if(r<0) r=sz;
		if(r<=a || b<=l) return e;
		if(a<=l && r<=b) return node[k];
		else{
			Monoid vl=query(a,b,2*k+1,l,(l+r)/2);
			Monoid vr=query(a,b,2*k+2,(l+r)/2,r);
			return op(vl,vr);
		}
	}
	Monoid operator[](const int &k)const{
		return node[k+sz-1];
	}
};

template <class T>
class Compress{
	map<T,int> idx;
	map<int,T> value;
	vector<T> cmp;
public:
	int N;
	Compress(vector<T> v){
		for(auto& x:v) cmp.push_back(x);
		sort(cmp.begin(),cmp.end());
		cmp.erase(unique(cmp.begin(),cmp.end()),cmp.end());
		N = cmp.size();
		for(int i=0;i<N;i++) idx[cmp[i]] = i;
	}
	int id(T val){return idx[val];}
	T val(int id){return cmp[id];}
};

int main(){
	cin.tie(0);ios::sync_with_stdio(false);
	int n,k;
	cin>>n>>k;
	vector<ll> a(n),sum(n+1,0),b(n+1),cmp;
	rep(i,n){
		cin>>a[i];
		sum[i+1]=sum[i]+a[i];
	}
	rep(i,n+1){
		b[i]=sum[i]-k*i;
	}
	for(auto &x:b){
		cmp.push_back(x);
	}
	sort(begin(cmp),end(cmp));
	cmp.erase(unique(begin(cmp),end(cmp)),end(cmp));
	map<ll,int> mp;
	rep(i,cmp.size()){
		mp[cmp[i]]=i;
	}
	for(auto &x:b) x=mp[x];
	auto op=[](ll a,ll b){return a+b;};
	SegmentTree<ll,decltype(op)> seg(n+1,op,0);
	ll ans=0;
	seg.update(b[0],1);
	FOR(r,1,n+1){
		ans+=seg.query(0,b[r]+1);
		seg.update(b[r],seg.query(b[r],b[r]+1)+1);
	}
	cout<<ans<<endl;
}

Measured memory_bytes: 23152