#include <bits/stdc++.h>
using namespace std;
#define FOR(i,m,n) for(int i=(m);i<(n);++i)
#define REP(i,n) FOR(i,0,n)
using ll = long long;
constexpr int INF = 0x3f3f3f3f;
constexpr long long LINF = 0x3f3f3f3f3f3f3f3fLL;
constexpr double EPS = 1e-8;
constexpr int MOD = 998244353;
// constexpr int MOD = 1000000007;
constexpr int DY4[]{1, 0, -1, 0}, DX4[]{0, -1, 0, 1};
constexpr int DY8[]{1, 1, 0, -1, -1, -1, 0, 1};
constexpr int DX8[]{0, -1, -1, -1, 0, 1, 1, 1};
template <typename T, typename U>
inline bool chmax(T& a, U b) { return a < b ? (a = b, true) : false; }
template <typename T, typename U>
inline bool chmin(T& a, U b) { return a > b ? (a = b, true) : false; }
struct IOSetup {
  IOSetup() {
    std::cin.tie(nullptr);
    std::ios_base::sync_with_stdio(false);
    std::cout << fixed << setprecision(20);
  }
} iosetup;

int main() {
  int n, x; cin >> n >> x;
  vector<ll> a(n * 2); REP(i, n) cin >> a[i];
  copy(a.begin(), next(a.begin(), n), next(a.begin(), n));
  FOR(i, 1, n * 2) a[i] += a[i - 1];
  if (a[n - 1] <= x) {
    cout << a[n - 1] << '\n';
    return 0;
  }
  int ans = 0;
  REP(i, n) {
    const int index = distance(a.begin(), upper_bound(next(a.begin(), i), a.end(), (i == 0 ? 0 : a[i - 1]) + x));
    if (index > 0) chmax(ans, a[index - 1] - (i == 0 ? 0 : a[i - 1]));
  }
  cout << ans << '\n';
  return 0;
}