#include <iostream>
#include <vector>
#include <algorithm>
#include <cmath>
#include <queue>
#include <string>
#include <map>
#include <set>
#include <stack>
#include <tuple>
#include <deque>
#include <array>
#include <numeric>
#include <bitset>
#include <iomanip>
#include <cassert>
#include <chrono>
#include <random>
#include <limits>
#include <iterator>
#include <functional>
#include <sstream>
#include <fstream>
#include <complex>
#include <cstring>
#include <unordered_map>
#include <unordered_set>
using namespace std;

using ll = long long;
using P = pair<int, int>;
constexpr int INF = 1001001001;
// constexpr int mod = 1000000007;
constexpr int mod = 998244353;

template<class T>
inline bool chmax(T& x, T y){
    if(x < y){
        x = y;
        return true;
    }
    return false;
}
template<class T>
inline bool chmin(T& x, T y){
    if(x > y){
        x = y;
        return true;
    }
    return false;
}

int main(){
    ios::sync_with_stdio(false);
    cin.tie(nullptr);

    int n, w;
    cin >> n >> w;
    vector<int> a(n);
    for(int i = 0; i < n; ++i)  cin >> a[i];

    int ans = 0, l = 0;
    ll sum = 0;
    set<int> st;
    for(int r = 0; r < n; ++r){
        while(sum + a[r] > w || st.find(a[r]) != st.end()){
            st.erase(a[l]);
            sum -= a[l++];
        }
        st.emplace(a[r]);
        sum += a[r];
        chmax(ans, r - l + 1);
    }

    cout << ans << endl;

    return 0;
}