{"raw_statement":[{"iden":"problem statement","content":"You are given a sequence of positive integers of length $N$, $A=a_1,a_2,…,a_{N}$, and an integer $K$. How many contiguous subsequences of $A$ satisfy the following condition?\n\n*   (Condition) The sum of the elements in the contiguous subsequence is at least $K$.\n\nWe consider two contiguous subsequences different if they derive from different positions in $A$, even if they are the same in content.\nNote that the answer may not fit into a $32$\\-bit integer type."},{"iden":"constraints","content":"*   $1 \\leq a_i \\leq 10^5$\n*   $1 \\leq N \\leq 10^5$\n*   $1 \\leq K \\leq 10^{10}$"},{"iden":"input","content":"Input is given from Standard Input in the following format:\n\n$N$ $K$\n$a_1$ $a_2$ $...$ $a_N$"},{"iden":"sample input 1","content":"4 10\n6 1 2 7"},{"iden":"sample output 1","content":"2\n\nThe following two contiguous subsequences satisfy the condition:\n\n*   $A[1..4]=a_1,a_2,a_3,a_4$, with the sum of $16$\n*   $A[2..4]=a_2,a_3,a_4$, with the sum of $10$"},{"iden":"sample input 2","content":"3 5\n3 3 3"},{"iden":"sample output 2","content":"3\n\nNote again that we consider two contiguous subsequences different if they derive from different positions, even if they are the same in content."},{"iden":"sample input 3","content":"10 53462\n103 35322 232 342 21099 90000 18843 9010 35221 19352"},{"iden":"sample output 3","content":"36"}],"translated_statement":null,"sample_group":[],"show_order":["default"],"formal_statement":null,"simple_statement":null,"has_page_source":true}