#include <bits/stdc++.h>
#include <atcoder/all>
#define rep(i,n) for(int (i)=0;(i)<(n);(i)++)
#define rep2(i,m,n) for(int (i)=(m);(i)<(n);(i)++)
#define rep2ll(i,m,n) for(ll (i)=(m);(i)<(n);(i)++)
#define ALL(obj) (obj).begin(), (obj).end()
#define rALL(obj) (obj).rbegin(), (obj).rend()
using namespace std;
using ll = long long;
using P = pair<ll,ll>;
using mint = atcoder::modint998244353;
using VL = vector<ll>;
using VVL = vector<VL>;
using VVVL = vector<VVL>;
using VM = vector<mint>;
using VVM = vector<VM>;
using VVVM = vector<VVM>;
using VD = vector<double>;
using VVD = vector<VD>;
using VVVD = vector<VVD>;
template<class T>bool chmax(T &a, const T &b) { if (a<b) { a=b; return 1; } return 0; }
template<class T>bool chmin(T &a, const T &b) { if (b<a) { a=b; return 1; } return 0; }


int main(){
    ios::sync_with_stdio(false);
    cin.tie(0);
    ll n, x; cin>>n>>x;
    VL a(n); rep(i,n) cin>>a[i];
    ll sum = 0;
    rep(i,n) sum += a[i];
    if(sum <= x){
        cout<<sum;
        return 0;
    }
    rep(i,n) a.push_back(a[i]);
    VL b(2*n+1, 0);
    rep(i,2*n) b[i+1] = b[i] + a[i];
    ll ans = 0;
    rep(i,n){
        auto itr = upper_bound(ALL(b), b[i] + x);
        itr--;
        chmax(ans, *itr - b[i]);
    }
    cout<<ans;
    
    return 0;
}