#include <bits/stdc++.h>

using namespace std;
using ll = long long;

int main(){
    cin.tie(nullptr);
    ios_base::sync_with_stdio(false);

    ll N, X, S=0, r=0, mx=0, cnt=0;
    cin >> N >> X;
    vector<ll> A(N);
    for (int i=0; i<N; i++){
        cin >> A[i];
        S += A[i];
    }

    if (S <= X){
        cout << S << endl;
        return 0;
    }

    S = 0;
    for (int l=0; l<N; l++){
        while(S+A[r] <= X && cnt < N){
            S += A[r];
            r++;
            r %= N;
            cnt++;
        }
        mx = max(S, mx);
        if (cnt){
            S -= A[l];
            cnt--;
        }
    }

    cout << mx << endl;

    return 0;
}