#include <bits/stdc++.h>
using namespace std;

#define pb push_back
const int N = 2e5L + 11;
using ll = long long;
ll a[N], sum[N];

ll k;
ll ans = 0;
void solve(int l, int r) {
	if(l + 1 == r) return;
	int m = (l + r) / 2;
	vector <pair <ll, int>> v;
	for(int i = l; i < m; i ++)
		v.pb({sum[i] - i * k, 0});
	for(int i = m; i < r; i ++)
		v.pb({sum[i] - i * k, 1});
	sort(v.begin(), v.end());

	int acc = 0;
	for(auto i : v)
		if(i.second == 1)
			ans += acc;
		else
			acc ++;
	solve(l, m);
	solve(m, r);
}

int main() {
	ios :: sync_with_stdio(0);
	int n; cin >> n;
	cin >> k;
	for(int i = 1; i <= n; i ++)
		cin >> a[i];
	for(int i = 1; i <= n; i ++)
		sum[i] = sum[i - 1] + a[i];
	solve(0, n + 1);
	cout << ans << '\n';
}