import std;

void main() {
    int n, x;
    readf("%d %d\n", n, x);
    auto a = readln.split.to!(int[]);
    foreach(e; a) {
        a ~= e;
    }
    int ans = 0, ret = 0;
    for(int l = 0, r = 0; l < n; ++l) {
        while(r < 2 * n && r - l < n && ret + a[r] <= x) {
            ret += a[r++];
        }
        ans = max(ans, ret);
        if(l == r) {
            r++;
        } else {
            ret -= a[l];
        }
    }
    writeln(ans);
}