#include <bits/stdc++.h>

using namespace std;
void fast_io() {
    ios::sync_with_stdio(false);
    std::cin.tie(nullptr);
}
int main() {
    fast_io();
    int n, x;
    cin >> n >> x;
    vector<long long> a(2 * n);
    for (int i = 0; i < n; i++) {
        cin >> a[i];
        a[i + n] = a[i];
    }
    long long ans = 0;
    long long su = 0;
    for (int l = 0, r = 0; l < n; l++) {
        while (r < 2 * n && su + a[r] <= x) {
            su += a[r];
            r++;
        }
        ans = max(ans, su);
        if (l == r) {
            r++;
        } else {
            su -= a[l];
        }
    }
    cout << ans << "\n";
}