macro_rules! input {
    (source = $s:expr, $($r:tt)*) => {
        let mut iter = $s.split_whitespace();
        input_inner!{iter, $($r)*}
    };
    ($($r:tt)*) => {
        let s = {
            use std::io::Read;
            let mut s = String::new();
            std::io::stdin().read_to_string(&mut s).unwrap();
            s
        };
        let mut iter = s.split_whitespace();
        input_inner!{iter, $($r)*}
    };
}

macro_rules! input_inner {
    ($iter:expr) => {};
    ($iter:expr, ) => {};

    ($iter:expr, $var:ident : $t:tt $($r:tt)*) => {
        let $var = read_value!($iter, $t);
        input_inner!{$iter $($r)*}
    };
}

macro_rules! read_value {
    ($iter:expr, ( $($t:tt),* )) => {
        ( $(read_value!($iter, $t)),* )
    };

    ($iter:expr, [ $t:tt ; $len:expr ]) => {
        (0..$len).map(|_| read_value!($iter, $t)).collect::<Vec<_>>()
    };

    ($iter:expr, chars) => {
        read_value!($iter, String).chars().collect::<Vec<char>>()
    };

    ($iter:expr, usize1) => {
        read_value!($iter, usize) - 1
    };

    ($iter:expr, $t:ty) => {
        $iter.next().unwrap().parse::<$t>().expect("Parse error")
    };
}

fn main() {
  input! {
    n: u64,
    x: u64,
    axs: [i64; n],
  }
  println!(solve(n, x, axs));
}

pub fn solve(n: u64, x: u64, mut axs: Vec<i64>) -> String {
  // axsを昇順でソートする
  // (x, a, x-a) -> (x-a1, a2, left-a2)
  // rightが0以下になったら終わり
  let mut rest_x = x as i64;
  let mut counter = 0;
  axs.sort();
  for a in axs.iter() {
    let calc = rest_x - a;
    rest_x -= *a;
    if calc > 0 {
      counter += 1;
    } else {
      if calc == 0 {
        counter += 1;
      } else if calc < 0 {
        counter -= 1;
      }
      break;
    }
  }

  if rest_x > 0 {
    counter -= 1;
  }
  
  counter.to_string()
}