/* -*- coding: utf-8 -*-
 *
 * 2601.cc:  No.2601 Very Poor - yukicoder
 */

#include<cstdio>
#include<algorithm>
 
using namespace std;

/* constant */

const int MAX_N = 200000;
const int MAX_N2 = MAX_N * 2;

/* typedef */

typedef long long ll;

/* global variables */

int as[MAX_N];
ll ass[MAX_N2 + 1];

/* subroutines */

/* main */

int main() {
  int n, x;
  scanf("%d%d", &n, &x);
  for (int i = 0; i < n; i++) scanf("%d", as + i);

  int n2 = n * 2;
  for (int i = 0; i < n2; i++) ass[i + 1] = ass[i] + as[i % n];

  if (ass[n] <= x) { printf("%lld\n", ass[n]); return 0; }

  ll maxs = 0;
  for (int i = 0, j = 0; i < n; i++) {
    while (j < n2 && ass[j + 1] - ass[i] <= x) j++;
    maxs = max(maxs, ass[j] - ass[i]);
  }

  printf("%lld\n", maxs);

  return 0;
}