#include <bits/stdc++.h>

#define MAXN (200010)
#define ll long long
#define lowbit(x) ((x) & (-(x)))

int n;
ll k, a[MAXN];
ll b[MAXN], c[MAXN], cnt[MAXN];

int main(){
	scanf("%d%lld", &n, &k);
	for(int i = 1; i <= n; ++ i){
		scanf("%lld", a + i);
		a[i] -= k;
		a[i] += a[i - 1];
	}
	
	for(int i = 1; i <= n; ++ i){
		b[i + 1] = a[i];
	}
	b[1] = 0;
	++ n;
	std::sort(b + 1, n + b + 1);
	
	int m = std::unique(b + 1, n + b + 1) - b - 1;
	for(int i = 1; i <= n; ++ i){
		c[i] = std::lower_bound(b + 1, m + b + 1, a[i - 1]) - b;
	}
	
	ll ans = 0;
	for(int i = 1; i <= n; ++ i){
		
		for(int j = c[i]; j; j -= lowbit(j)) ans += cnt[j];
		for(int j = c[i]; j <= m; j += lowbit(j)) cnt[j] ++;
		
	}
	printf("%lld\n", ans);
	
	
	return 0;
}