#include <iostream>
#include <algorithm>
#include <vector>
#define int long long
using namespace std;
signed main() {
int n, len;
cin >> n >> len;
vector<int> A(2 * n);
for (int i = 0; i < n; i++) {
cin >> A[i];
A[n + i] = A[i];
}
n *= 2;
vector<int> B = {0}, C = {0};
for (int i = 0; i < n; i++)
B.push_back(B.back() + A[i]);
for (int i = 0; i < n; i++)
C.push_back(C.back() + (A[i] * (A[i] + 1)) / 2);
int ans = 0;
for (int i = 0; i < n; i++) {
if (B[i + 1] >= len) {
int z = upper_bound(B.begin(), B.end(), B[i + 1] - len) - B.begin();
int cnt = C[i + 1] - C[z];
int days = B[i + 1] - B[z];
int too = len - days;
cnt += ((A[z - 1] * (A[z - 1] + 1)) / 2);
cnt -= (((A[z - 1] - too) * (A[z - 1] - too + 1)) / 2);
ans = max(ans, cnt);
}
}
cout << ans;
}
I2luY2x1ZGUgPGlvc3RyZWFtPgojaW5jbHVkZSA8YWxnb3JpdGhtPgojaW5jbHVkZSA8dmVjdG9yPgogCiNkZWZpbmUgaW50IGxvbmcgbG9uZwogCnVzaW5nIG5hbWVzcGFjZSBzdGQ7CiAKc2lnbmVkIG1haW4oKSB7CiAgaW50IG4sIGxlbjsKICBjaW4gPj4gbiA+PiBsZW47CiAgdmVjdG9yPGludD4gQSgyICogbik7CiAgZm9yIChpbnQgaSA9IDA7IGkgPCBuOyBpKyspIHsKICAgIGNpbiA+PiBBW2ldOwogICAgQVtuICsgaV0gPSBBW2ldOwogIH0KICBuICo9IDI7CiAKICB2ZWN0b3I8aW50PiBCID0gezB9LCBDID0gezB9OwogIGZvciAoaW50IGkgPSAwOyBpIDwgbjsgaSsrKSAKICAgIEIucHVzaF9iYWNrKEIuYmFjaygpICsgQVtpXSk7CiAgZm9yIChpbnQgaSA9IDA7IGkgPCBuOyBpKyspIAogICAgQy5wdXNoX2JhY2soQy5iYWNrKCkgKyAoQVtpXSAqIChBW2ldICsgMSkpIC8gMik7CiAgaW50IGFucyA9IDA7CiAgZm9yIChpbnQgaSA9IDA7IGkgPCBuOyBpKyspIHsKICAgIGlmIChCW2kgKyAxXSA+PSBsZW4pIHsKICAgICAgaW50IHogPSB1cHBlcl9ib3VuZChCLmJlZ2luKCksIEIuZW5kKCksIEJbaSArIDFdIC0gbGVuKSAtIEIuYmVnaW4oKTsKICAgICAgaW50IGNudCA9IENbaSArIDFdIC0gQ1t6XTsKICAgICAgaW50IGRheXMgPSBCW2kgKyAxXSAtIEJbel07CiAgICAgIGludCB0b28gPSBsZW4gLSBkYXlzOwogICAgICBjbnQgKz0gKChBW3ogLSAxXSAqIChBW3ogLSAxXSArIDEpKSAvIDIpOwogICAgICBjbnQgLT0gKCgoQVt6IC0gMV0gLSB0b28pICogKEFbeiAtIDFdIC0gdG9vICsgMSkpIC8gMik7CiAgICAgIGFucyA9IG1heChhbnMsIGNudCk7CiAgICB9CiAgfQogIGNvdXQgPDwgYW5zOwp9