#include <bits/stdc++.h> 

using namespace std;
using ll = long long;
#define rep(i,n) for (int i = 0;i<(int)(n);i++)
#define inf 1001001001
#define infll 400400400400400400

ll bisect(int l,int r,vector<ll> &csum,ll &X, int &str){
    if (l > r){
        return csum.at(str+r) - csum.at(str);
    }
    int p = (l+r)/2;
    ll sample = csum.at(str+p) - csum.at(str);
    if (sample >= X){
        p--;
        return bisect(l,p,csum,X,str);
    }
    else{
        p++;
        return bisect(p,r,csum,X,str);       
    }
}

int main(){
    int N;
    ll X;
    cin >> N >> X;

    vector<ll> v(N*2);
    vector<ll> csum(N*2+1);
    csum.at(0) = 0;
    rep(i,N){
        ll n;
        cin >> n;
        v.at(i) = n;
        v.at(i+N) = n;
        csum.at(i+1) = csum.at(i) + n;
    }

    rep(i,N){
        csum.at(i+1+N) = csum.at(i+N) + v.at(i);
    }

    ll ans = 0;
    rep(i,N){
        int l = 0;
        ll y = bisect(l,N,csum,X,i);
        ans = max(ans,y);
    }

    cout << ans << endl;
}