from bisect import *

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

if sum(a) <= x:
    print(sum(a))
    exit()
    
b = a+a
acc = [0]
for i in b:
    acc.append(acc[-1]+i)

ans = 0
   
for i in range(n):
    ind = bisect_right(acc,acc[i]+x)
    tmp = acc[ind-1]-acc[i]
    ans = max(ans,tmp)
    
print(ans)