import sys
sys.setrecursionlimit(5*10**5)
input = sys.stdin.readline
from collections import defaultdict, deque, Counter
from heapq import heappop, heappush
from bisect import bisect_left, bisect_right
from math import gcd
def pre_f(a, f):
    pre = a[::1]
    for i in range(1,len(a)):
        pre[i] = f(pre[i-1], pre[i])
    return pre    
def suf_f(a, f):
    suf = a[::1]
    for i in range(len(a)-1)[::-1]:
        suf[i] = f(suf[i+1], suf[i])
    return suf    

n,x = map(int,input().split())
a = list(map(int,input().split()))
if sum(a) <= x:
    print(sum(a))
else:
    a = a+a
    pre = a[::1]
    ans = 0
    for i in range(1,2*n):
        pre[i] += pre[i-1]
    for i in range(2*n):
        t = bisect_right(pre, pre[i]+ x)
        ans = max(ans, pre[t-1]-pre[i])
    
    print(ans)