from bisect import bisect_right
n,x = map(int,input().split())
a = list(map(int,input().split()))
if sum(a)<=x: exit(print(sum(a)))
b = [0]+a+a; ans = 0
for i in range(2*n): b[i+1] += b[i]
for i in range(n):
    j = bisect_right(b,b[i]+x)
    ans = max(ans,b[j-1]-b[i])
print(ans)