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<bits/stdc++.h>
using namespace std;
#define int long long
int n,m,s[200100],t[200100],res;
vector<int>v;
void ADD(int x){while(x<=m)t[x]++,x+=x&-x;}
int ASK(int x){int r=0;while(x)r+=t[x],x-=x&-x;return r;}
signed main(){
	scanf("%lld%lld",&n,&m),v.push_back(0);
	for(int i=1;i<=n;i++)scanf("%lld",&s[i]),s[i]-=m,s[i]+=s[i-1],v.push_back(s[i]);
	sort(v.begin(),v.end()),v.resize(unique(v.begin(),v.end())-v.begin()),m=v.size();
	for(int i=0;i<=n;i++)s[i]=lower_bound(v.begin(),v.end(),s[i])-v.begin()+1,res+=ASK(s[i]),ADD(s[i]);
	printf("%lld\n",res);
	return 0;
}