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>
#define ll long long
#define int ll
using namespace std;
const int N=2e5+5;
int n,k,x[N],y[N];
ll tree[N],ans;
inline int lowbit(int x){return x&(-x);}
void update(int x){for(;x<=n;x+=lowbit(x))tree[x]++;}
int ask(int x){int res=0;for(;x;x-=lowbit(x))res+=tree[x];return res;}
signed main()
{
	cin>>n>>k;
	for(int i=1;i<=n;i++)cin>>x[i],x[i]-=k;
	for(int i=1;i<=n;i++)x[i]+=x[i-1],y[i]=x[i],ans+=(x[i]>=0);
	sort(y+1,y+n+1);
	for(int i=1;i<=n;i++)x[i]=lower_bound(y+1,y+n+1,x[i])-y;
	for(int i=1;i<=n;i++)ans+=ask(x[i]),update(x[i]);
	cout<<ans<<"\n";
	return 0;
}