#![allow(unused_imports, unused_macros, dead_code)]

macro_rules! min {
    (.. $x:expr) => {{
        let mut it = $x.iter();
        it.next().map(|z| it.fold(z, |x, y| min!(x, y)))
    }};
    ($x:expr) => ($x);
    ($x:expr, $($ys:expr),*) => {{
        let t = min!($($ys),*);
        if $x < t { $x } else { t }
    }}
}
macro_rules! max {
    (.. $x:expr) => {{
        let mut it = $x.iter();
        it.next().map(|z| it.fold(z, |x, y| max!(x, y)))
    }};
    ($x:expr) => ($x);
    ($x:expr, $($ys:expr),*) => {{
        let t = max!($($ys),*);
        if $x > t { $x } else { t }
    }}
}
macro_rules! ewriteln {
    ($($args:expr),*) => { let _ = writeln!(&mut std::io::stderr(), $($args),*); };
}
macro_rules! trace {
    ($x:expr) => { ewriteln!(">>> {} = {:?}", stringify!($x), $x) };
    ($($xs:expr),*) => { trace!(($($xs),*)) }
}
macro_rules! flush {
    () => {
        std::io::stdout().flush().unwrap();
    };
}
macro_rules! put {
    (.. $x:expr) => {{
        let mut it = $x.iter();
        if let Some(x) = it.next() { print!("{}", x); }
        for x in it { print!(" {}", x); }
        println!("");
    }};
    ($x:expr) => { println!("{}", $x) };
    ($x:expr, $($xs:expr),*) => { print!("{} ", $x); put!($($xs),*) }
}

const M: i64 = 1_000_000_007;

struct Counter<X> {
    data: std::collections::HashMap<X, usize>,
}

impl<X: Eq + std::hash::Hash> Counter<X> {
    fn new() -> Self {
        Self {
            data: std::collections::HashMap::new(),
        }
    }
    fn add(&mut self, x: X) {
        *self.data.entry(x).or_insert(0) += 1;
    }
    fn del(&mut self, x: &X) {
        match self.data.get_mut(x) {
            Some(x) => {
                *x -= 1;
            }
            None => {}
        }
    }
    fn get(&self, x: X) -> usize {
        match self.data.get(&x) {
            Some(x) => *x,
            None => 0,
        }
    }
}

fn main() {
    let mut sc = Scanner::new();
    let n: usize = sc.cin();
    let w: i128 = sc.cin();
    let xs: Vec<i128> = sc.vec(n);

    let mut left = 0;
    let mut summ = 0;
    let mut len = 0;
    let mut cx = Counter::new();

    let mut ans = 0;
    for right in 0..n {
        summ += xs[right];
        cx.add(xs[right]);
        len += 1;
        if summ <= w && cx.get(xs[right]) <= 1 {
            // trace!(left, right);
            ans = max!(ans, len);
        } else {
            while summ > w || cx.get(xs[right]) > 1 {
                summ -= xs[left];
                cx.del(&xs[left]);
                len -= 1;
                left += 1;
            }
        }
    }
    put!(ans);
}

use std::collections::VecDeque;
use std::io::{self, Write};
use std::str::FromStr;

struct Scanner {
    stdin: io::Stdin,
    buffer: VecDeque<String>,
}
impl Scanner {
    fn new() -> Self {
        Scanner {
            stdin: io::stdin(),
            buffer: VecDeque::new(),
        }
    }
    fn cin<T: FromStr>(&mut self) -> T {
        while self.buffer.is_empty() {
            let mut line = String::new();
            let _ = self.stdin.read_line(&mut line);
            for w in line.split_whitespace() {
                self.buffer.push_back(String::from(w));
            }
        }
        self.buffer.pop_front().unwrap().parse::<T>().ok().unwrap()
    }
    fn chars(&mut self) -> Vec<char> {
        self.cin::<String>().chars().collect()
    }
    fn vec<T: FromStr>(&mut self, n: usize) -> Vec<T> {
        (0..n).map(|_| self.cin()).collect()
    }
}