n,w=map(int,input().split())
A=[int(input()) for i in range(n)]

Q=set()
S=0

r=0
ANS=0
for i in range(n):
    while r<n and not(A[r] in Q) and S+A[r]<=w:
        Q.add(A[r])
        S+=A[r]
        r+=1

    ANS=max(ANS,len(Q))
    Q.remove(A[i])
    S-=A[i]

print(ANS)