#include <iostream>
#include <vector>
#include <set>

using lint = long long;

void solve() {
    int n;
    lint w;
    std::cin >> n >> w;

    std::vector<lint> xs(n);
    for (auto& x : xs) std::cin >> x;

    int ans = 0, r = 0;
    lint sum = 0;
    std::set<int> s;

    for (int l = 0; l < n; ++l) {
        while (r < n && sum + xs[r] <= w && !s.count(xs[r])) {
            sum += xs[r];
            s.insert(xs[r]);
            ++r;
        }
        ans = std::max(ans, r - l);

        sum -= xs[l];
        s.erase(xs[l]);
    }

    std::cout << ans << "\n";
}

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

    solve();

    return 0;
}