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
N,K=map(int,input().split())

alist=[]
slist=[0]
for i in range(N):
  a=int(input())
  alist.append(a)
  slist.append(slist[-1]+a)
#print(alist)
#print(slist)

splist=[]
for i in range(N+1):
  splist.append(slist[i]-i*K)
#print(splist)

#compress splist to spdic
sp_asc=sorted(list(set(splist)))
#print(sp_asc)
cnt=1
spdic={}
for sp in sp_asc:
  spdic[sp]=cnt
  cnt+=1
#print(spdic)
  
#A1～Aiまでの和 O(logN)
def BIT_query(idx):
  res_sum = 0
  while idx > 0:
    res_sum += BIT[idx]
    idx -= idx&(-idx)
  return res_sum
#Ai += x O(logN)
def BIT_update(idx,x,n):
  while idx <= n:
    BIT[idx] += x
    idx += idx&(-idx)
  return

answer=0
BIT=[0]*(len(spdic)+1)
for i in range(N+1):
  idx=spdic[splist[i]]
  answer+=BIT_query(idx)
  BIT_update(idx,1,len(spdic))
  #print(i,answer)
  
print(answer)