#include <iostream>
#include <vector>
#include <bits/stdc++.h>

using namespace std;

int main()
{
    int n, m;
    cin >> n >> m;
    vector <int> v(n);
    for(int i = 0; i < n; i++)
        cin >> v[i];
    int ans = 0, l = 0, r = 1;

    if(accumulate(v.begin(), v.end(), 0) <= m){
        cout << accumulate(v.begin(), v.end(), 0);
        return 0;
    }

    while(l != n){
        int cntsum = 0;
        for(int i = l; i < r; i++){
            int indx = i % n;
            cntsum += v[indx];
            if(cntsum == m){
                cout << m;
                return 0;
            }
            if(cntsum < m){
                r++;
            }
            else{
                l++;
                r = l + 1;
                ans = max(ans, cntsum - v[indx]);
                break;
            }
        }
    }

    cout << ans;
	return 0;
}