#include<iostream>
#include<vector>
#include<algorithm>

using namespace std;
using ll = long long;


#include<atcoder/modint>
using mint = atcoder::modint998244353;

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

    ll ans = 0;
    ll n,x;
    cin>>n>>x;
    vector<ll> a(n);
    for(int i = 0;i<n;i++) cin>>a[i];
    vector<ll> sum(n+1,0);
    for(int i =0 ;i<n;i++){
        sum[i+1] = sum[i] + a[i];
    }
    for(int i = 0;i<n;i++){
        if(a[i]>x) continue;
        int right = n;
        int left = 0;
        while(right-left>1){
            int mid = (right+left) / 2;
            ll use = 0;
            if(i+mid<=n){
                use = sum[i+mid] - sum[i];
            }else{
                use = sum[n] - sum[i];
                int res = mid - (n-i);
                use += sum[res];
            }
            if(use<=x) ans = max(ans,use);
            if(use<=x) left = mid;
            else right = mid;
        }
    }
    cout<<ans<<endl;
}