import times, strutils, sequtils, math, algorithm, tables, sets, lists, intsets
import critbits, future, strformat, deques
template `max=`(x,y) = x = max(x,y)
template `min=`(x,y) = x = min(x,y)
template `mod=`(x,y) = x = x mod y
template scan2 = (scan(), scan())
template scan3 = (scan(), scan())
let read* = iterator: string {.closure.} =
    while true: (for s in stdin.readLine.split: yield s)
proc scan(): int = read().parseInt
proc scanf(): float = read().parseFloat
proc toInt(c:char): int =
    return int(c) - int('0')



proc solve():int=
  var
    n = scan()
    w = scan()
    a = newseqwith(n,scan())
    left = 0
    cum = 0
    exists = initHashSet[int]()
  for right in 0..<n:
    while left < right and (cum > w or a[right] in exists):
      cum-=a[left]
      exists.excl(a[left])
      left+=1
    exists.incl(a[right])
    cum+=a[right]
    if cum<w:
      result.max=right-left+1
    
    
    #echo fmt"{left}, {right}"


      

  

  
echo solve()