You are given an integer sequence of length N, a = {a_1, a_2, …, a_N}, and an integer K.

a has N(N+1)/2 non-empty contiguous subsequences, {a_l, a_{l+1}, …, a_r} (1 ≤ l ≤ r ≤ N). Among them, how many have an arithmetic mean that is greater than or equal to K?

Constraints

* All input values are integers.
* 1 ≤ N ≤ 2 \times 10^5
* 1 ≤ K ≤ 10^9
* 1 ≤ a_i ≤ 10^9

Input

Input is given from Standard Input in the following format:


N K
a_1
a_2
:
a_N


Output

Print the number of the non-empty contiguous subsequences with an arithmetic mean that is greater than or equal to K.

Examples

Input

3 6
7
5
7


Output

5


Input

1 2
1


Output

0


Input

7 26
10
20
30
40
30
20
10


Output

13
#include<iostream>
#include<cstdio>
#include<map>
#include<algorithm>
using namespace std;
const int MAXN = 200010;
long long a[MAXN],b[MAXN],c[MAXN],sum[MAXN];
map<long long,int> mp;
int n,k,nn;
int lowbit(int x) {return x&(-x);}
int getSum(int x) {
	int ans = 0;
	while (x>0) {
		ans += sum[x];
		x -= lowbit(x);
	}
	return ans;
}
void update(int x,int num) {
	while (x<=nn) {
		sum[x] += num;
		x += lowbit(x);
	}
}
int main()
{
	while (scanf("%d%d",&n,&k)!=EOF) {
		for (int i=1;i<=n;i++) scanf("%d",&a[i]);
		c[0] = 0,b[0] = 0;
		for (int i=1;i<=n;i++) {
			c[i] = c[i-1] + a[i] - k;
			b[i] = c[i];
		}
		sort(b,b+1+n);
		nn = 0;
		mp.clear();
		for (int i=0;i<=n;i++) {
			if (!mp[b[i]]) mp[b[i]] = ++nn;
		}
		long long ans = 0;
		for (int i=0;i<=n;i++) {
			ans += getSum(mp[c[i]]);
			update(mp[c[i]],1);
		}
		printf("%lld\n",ans);
	}
}