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 <= 10000, -100<=A[i]<=100, 0<=B<=10000

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

Nobody believes in you, you lost again and again.the lights are cut off but you are still looking at your dream, reviewing it every day and say to yourself: it is not over until I win...... I never leave cp until I can't reach in specialist