Bob was travelling one day in a hypothetical world (:p) and saw a number of trees of different heights on the road. In total he saw N trees. Since he was getting bored, he started noting the heights of all the trees in the same order as he found them while travelling. Lets represent the heights of trees using an array H with H₁, H₂, .... H_N being the heights of trees in order. In total he travelled K Miles. Back in his home, he started to wonder what is the largest number of consecutive trees that have a sum of heights less than or equal to K. He is finding it difficult to find out, can you help him ?

Input: 
First line consists of two space separated integers, N and K, representing number of trees seen by Bob and distance in miles travelled by Bob.
Second line consists of N space separated integers: H₁, H₂, ... H_N.

Output: 
A single integer that represents the largest number of consecutive trees that have the sum of heights less than or equal to K.

Constaints: 
1 $\leq$ N $\leq$ 10⁵
1 $\leq$ H_i $\leq$ 10⁹
1 $\leq$ K $\leq$ 10¹⁵