from collections import deque

N,X=map(int,input().split())
A=list(map(int,input().split()))

A=A+A+A

Q=deque()
ANS=0

ind=0
SUM=0
for i in range(3*N):
    ind=max(ind,i)
    while ind<len(A) and SUM+A[ind]<=X and len(Q)<=N-1:
        Q.append(A[ind])
        SUM+=A[ind]
        ind+=1

    ANS=max(ANS,SUM)

    if Q:
        x=Q.popleft()
        SUM-=x

print(ANS)