from bisect import bisect_right

n, x = map(int, input().split())
A = list(map(int, input().split()))

sumA = sum(A)
C = [0]
for i in range(2 * n + 1):
    C.append(C[-1] + A[i % n])
ans = 0
for i in range(n + 1):
    res = C[i] + x
    idx = bisect_right(C, res) - 1
    ans = max(ans, min(C[idx] - C[i], sumA))
print(ans)