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
import sys
input = sys.stdin.buffer.readline
import bisect

def main():
	N,K = map(int,input().split())
	cum = [0]
	for _ in range(N):
		cum.append(cum[-1]+int(input())-K)

	s_cum = sorted(cum)

	def invNumCount(A):
		l = len(A)
		res = 0
		BIT = [0]*(l+1)

		def BIT_query(idx):
			res_sum = 0
			while idx > 0:
				res_sum += BIT[idx]
				idx -= idx&(-idx)
			return res_sum

		def BIT_update(idx,x):
			while idx <= l:
				BIT[idx] += x
				idx += idx&(-idx)
			return

		Ai = [None]*l
		for i,e in enumerate(A):
			Ai[e] = i
		for i,e in enumerate(Ai):
			res += i - BIT_query(e+1)
			BIT_update(e+1,1)
		return res

	d = {}
	pos = [None]*(N+1)
	for i,num in enumerate(cum):
		ind = bisect.bisect_left(s_cum,num)
		if num not in d:
			d[num] = 1
		else:
			ind += d[num]
			d[num] += 1
		pos[i] = N-ind

	print(invNumCount(pos))

if __name__ == "__main__":
	main()