Petya has an array a consisting of n integers. He has learned partial sums recently, and now he can calculate the sum of elements on any segment of the array really fast. The segment is a non-empty sequence of elements standing one next to another in the array.

Now he wonders what is the number of segments in his array with the sum less than t. Help Petya to calculate this number.

More formally, you are required to calculate the number of pairs l, r (l ≤ r) such that a_l + a_{l+1} + ... + a_{r-1} + a_r < t.

Input

The first line contains two integers n and t (1 ≤ n ≤ 200 000, |t| ≤ 2⋅10^{14}).

The second line contains a sequence of integers a_1, a_2, ..., a_n (|a_{i}| ≤ 10^{9}) — the description of Petya's array. Note that there might be negative, zero and positive elements.

Output

Print the number of segments in Petya's array with the sum of elements less than t.

Examples

Input

5 4
5 -1 3 4 -1


Output

5


Input

3 0
-1 2 -3


Output

4


Input

4 -1
-2 1 -2 3


Output

3

Note

In the first example the following segments have sum less than 4:

  * [2, 2], sum of elements is -1 
  * [2, 3], sum of elements is 2 
  * [3, 3], sum of elements is 3 
  * [4, 5], sum of elements is 3 
  * [5, 5], sum of elements is -1 
// package codeforce.Training1900;

import java.io.PrintWriter;
import java.util.Scanner;

public class PetyaandArray {

    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        PrintWriter pw = new PrintWriter(System.out);
        int t = 1;
        for (int i = 0; i < t; i++) {
            solve(sc, pw);
        }
        pw.close();
    }

    static void solve(Scanner in, PrintWriter out){
        int n = in.nextInt();
        long t = in.nextLong();
        int[] arr = new int[n];
        for (int i = 0; i < n; i++) {
            arr[i] = in.nextInt();
        }
        AVLTreePBDS treap = new AVLTreePBDS(true);
        long sum = 0;
        treap.add(sum);
        long ans = 0;
        for (int i = 0; i < n; i++) {
            sum += arr[i];
            long limit = sum - t + 1;
            int cnt = treap.orderOfKey(limit);
            ans += (treap.size() - cnt);
            treap.add(sum);
        }
        out.println(ans);
    }

    //findByOrder and initialize with false as the input for constructor
    static class AVLTreePBDS{
        private Node root;
        private boolean multi;

        AVLTreePBDS (boolean multi) {
            this.root = null;
            this.multi = multi;
        }

        int size() {
            return size(root);
        }

        boolean isEmpty() {
            return size(root) == 0;
        }

        boolean contains(long key) {
            return contains(root, key);
        }

        void add(long key) {
            root = add(root, key);
        }

        void remove(long key) {
            root = remove(root, key);
        }

        Long first() {
            Node min = findMin(root);
            return min != null ? min.key : null;
        }

        Long last() {
            Node max = findMax(root);
            return max != null ? max.key : null;
        }

        Long poolFirst() {
            Node min = findMin(root);
            if (min != null) {
                remove(min.key);
                return min.key;
            }
            return null;
        }

        Long poolLast() {
            Node max = findMax(root);
            if (max != null) {
                remove(max.key);
                return max.key;
            }
            return null;
        }

        // min >= key
        Long ceiling(long key) {
            return contains(key) ? key : higher(key);
        }

        // max <= key
        Long floor(long key) {
            return contains(key) ? key : lower(key);
        }

        // min > key
        Long higher(long key) {
            Node min = higher(root, key);
            return min == null ? null : min.key;
        }

        private Node higher(Node cur, long key) {
            if (cur == null)
                return null;

            if (cur.key <= key)
                return higher(cur.right, key);

            // cur.key > key
            Node left = higher(cur.left, key);
            return left == null ? cur : left;
        }

        // max < key
        Long lower(long key) {
            Node max = lower(root, key);
            return max == null ? null : max.key;
        }

        private Node lower(Node cur, long key) {
            if (cur == null)
                return null;

            if (cur.key >= key)
                return lower(cur.left, key);

            // cur.key < key
            Node right = lower(cur.right, key);
            return right == null ? cur : right;
        }

        private class Node {
            int height, size;
            long key;
            Node left, right;

            Node(long key) {
                this.key = key;
                height = size = 1;
                left = right = null;
            }
        }

        private int height(Node cur) {
            return cur == null ? 0 : cur.height;
        }

        private int balanceFactor(Node cur) {
            return height(cur.right) - height(cur.left);
        }

        private int size(Node cur) {
            return cur == null ? 0 : cur.size;
        }

        // fixVertex
        private void fixHeightAndSize(Node cur) {
            cur.height = Math.max(height(cur.left), height(cur.right)) + 1;
            cur.size = size(cur.left) + size(cur.right) + 1;
        }

        private Node rotateRight(Node cur) {
            Node prevLeft = cur.left;
            cur.left = prevLeft.right;
            prevLeft.right = cur;
            fixHeightAndSize(cur);
            fixHeightAndSize(prevLeft);
            return prevLeft;
        }

        private Node rotateLeft(Node cur) {
            Node prevRight = cur.right;
            cur.right = prevRight.left;
            prevRight.left = cur;
            fixHeightAndSize(cur);
            fixHeightAndSize(prevRight);
            return prevRight;
        }

        private Node balance(Node cur) {
            fixHeightAndSize(cur);
            if (balanceFactor(cur) == 2) {
                if (balanceFactor(cur.right) < 0)
                    cur.right = rotateRight(cur.right);
                return rotateLeft(cur);
            }
            if (balanceFactor(cur) == -2) {
                if (balanceFactor(cur.left) > 0)
                    cur.left = rotateLeft(cur.left);
                return rotateRight(cur);
            }
            return cur;
        }

        private boolean contains(Node cur, long key) {
            if (cur == null)
                return false;
            else if (key < cur.key)
                return contains(cur.left, key);
            else if (key > cur.key)
                return contains(cur.right, key);
            else
                return true;
        }

        private Node add(Node cur, long key) {
            if (cur == null)
                return new Node(key);

            if (key < cur.key)
                cur.left = add(cur.left, key);
            else if (key > cur.key || multi)
                cur.right = add(cur.right, key);

            return balance(cur);
        }

        private Node findMin(Node cur) {
            return cur.left != null ? findMin(cur.left) : cur;
        }

        private Node findMax(Node cur) {
            return cur.right != null ? findMax(cur.right) : cur;
        }

        private Node removeMin(Node cur) {
            if (cur.left == null)
                return cur.right;

            cur.left = removeMin(cur.left);
            return balance(cur);
        }

        private Node removeMax(Node cur) {
            if (cur.right == null)
                return cur.left;

            cur.right = removeMax(cur.right);
            return balance(cur);
        }

        private Node remove(Node cur, long key) {
            if (cur == null)
                return null;

            if (key < cur.key)
                cur.left = remove(cur.left, key);
            else if (key > cur.key)
                cur.right = remove(cur.right, key);
            else { //  k == cur.key
                Node prevLeft = cur.left;
                Node prevRight = cur.right;

                if (prevRight == null)
                    return prevLeft;

                Node min = findMin(prevRight);
                min.right = removeMin(prevRight);
                min.left = prevLeft;

                return balance(min);
            }

            return balance(cur);
        }

        int orderOfKey(long key) {
            return orderOfKey(root, key);
        }

        // count < key
        private int orderOfKey(Node cur, long key) {
            if (cur == null)
                return 0;

            if (cur.key < key)
                return size(cur.left) + 1 + orderOfKey(cur.right, key);

            if (cur.key == key)
                return size(cur.left);

            // cur.key > key
            return orderOfKey(cur.left, key);
        }

        Long findByOrder(int pos) {
            return size(root) > pos ? findByOrder(root, pos) : null;
        }

        // get i-th
        private long findByOrder(Node cur, int pos) {
            if (size(cur.left) > pos)
                return findByOrder(cur.left, pos);

            if (size(cur.left) == pos)
                return cur.key;

            // size(cur.left) < pos
            return findByOrder(cur.right, pos - 1 - size(cur.left));
        }
    }

}



