Problem Description

Given an array A of N length and you are also given number B.

You need to find the number of subarrays in A having sum less than B. We may assume that there is no overflow.

Problem Constraints 1 <= N <= 100000 -100 <= A[i] <= 100 0 <= B <= 10000

Example: INPUT:: A----> [1,−2,4,8] k=0 OUTPUT:: 2