#include <stdio.h>
#include <bits/stdc++.h>
#include <atcoder/all>
using namespace atcoder;
using mint = modint998244353;
using namespace std;
#define rep(i,n) for (int i = 0; i < (n); ++i)
#define Inf32 1000000001
#define Inf64 4000000000000000001


int main(){
	
	int n;
	cin>>n;
	long long x;
	cin>>x;
	vector<long long> s(n+1);
	rep(i,n){
		cin>>s[i+1];
		s[i+1] += s[i];
	}
	long long ans = 0;
	rep(i,n){
		int d = distance(s.begin(),upper_bound(s.begin(),s.end(),s[i] + x));
		ans = max(ans,s[d-1] - s[i]);
	}
	cout<<ans<<endl;
	
	return 0;
}