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 java.util.*;

public class Main {
    static long[] bit;
    static int len;

    static void add(int x, long y) {
        while (x<=len) {
            bit[x] += y;
            x += x&(-x);
        }
    }

    static long sum(int x) {
        long tmp = 0L;
        while (x>0) {
            tmp += bit[x];
            x -= x&(-x);
        }
        return tmp;
    }

    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        int N = sc.nextInt();
        int K = sc.nextInt();
        int[] a = new int[N];
        for (int i=0;i<N;i++) {
            a[i] = sc.nextInt();
            a[i] -= K;
        }
        long[] ruiseki = new long[N+1];
        TreeSet<Long> set = new TreeSet<Long>();
        set.add(0L);
        for (int i=0;i<N;i++) {
            ruiseki[i+1] = ruiseki[i]+a[i];
            set.add(ruiseki[i+1]);
        }
        ArrayList<Long> list = new ArrayList<Long>(set);
        int[] ruiseki_new = new int[N+1];
        for (int i=0;i<N+1;i++) {
            ruiseki_new[i] = Collections.binarySearch(list, ruiseki[i])+1;
        }

        len = list.size();
        bit = new long[len+1];
        for (int i=0;i<N+1;i++) {
            add(ruiseki_new[i], 1);
        }
        long ans = 0L;
        for (int i=0;i<N+1;i++) {
            add(ruiseki_new[i], -1);
            ans += (N-i-sum(ruiseki_new[i]-1));
        }
        System.out.println(ans);
    }
}