#include <bits/stdc++.h>
using namespace std;
#include <atcoder/segtree>
using namespace atcoder;

long long op(long long a, long long b) {
  return a + b;
}

long long e() {
  return (long long)0;
}

int main() {
  int N;
  long long X;
  cin >> N >> X;
  vector<long long> A(N);
  for (int i = 0; i < N; i++) {
    cin >> A[i];
  }
  for (int i = 0; i < N; i++) {
    A.push_back(A[i]);
  }
  segtree<long long, op, e> seg(2 * N);
  for (int i = 0; i < 2 * N; i++) {
    seg.set(i, A[i]);
  }
  long long ans = 0;
  for (int i = 0; i < N; i++) {
    if (A[i] > X) {
      continue;
    }
    int ac = i, wa = i + N;
    while (abs(ac - wa) > 1) {
      int wj = (ac + wa) / 2;
      // cout << ac << " " << wa << " " << wj << endl;
      if (seg.prod(i, wj + 1) <= X) {
        ac = wj;
      } else {
        wa = wj;
      }
    }
    ans = max(ans, seg.prod(i, ac + 1));
  }
  cout << ans << endl;
  return 0;
}