#pragma GCC optimize("O2") #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #define int ll #define INT128_MAX (__int128)(((unsigned __int128) 1 << ((sizeof(__int128) * __CHAR_BIT__) - 1)) - 1) #define INT128_MIN (-INT128_MAX - 1) #ifdef DEBUG #define dbg(x) cout << (#x) << " = " << x << '\n' #else #define dbg(x) #endif namespace R = std::ranges; namespace V = std::views; using namespace std; using ll = long long; using ull = unsigned long long; using ldb = long double; //#define double ldb template ostream& operator<<(ostream& os, const array &arr) { for(const T &X : arr) os << X << ' '; return os; } template ostream& operator<<(ostream& os, const vector &vec) { for(const T &X : vec) os << X << ' '; return os; } template ostream& operator<<(ostream& os, const set &s) { for(const T &x : s) os << x << ' '; return os; } signed main() { ios::sync_with_stdio(false), cin.tie(NULL); int n, x; cin >> n >> x; vector a(n); for(int &x : a) cin >> x; for(int i = 0; i < n; i++) a.emplace_back(a[i]); int ans = 0; for(int l = 0, r = -1, sum = 0; l < n; l++) { if (r < l - 1) sum += a[++r]; while(r + 1 < l + n and sum + a[r + 1] <= x) sum += a[++r]; ans = max(ans, sum), sum -= a[l]; } cout << ans << '\n'; return 0; }