; 与えられた Ci を昇順ソートして小さいものから足し続ける
; m を超えたときのインデックスを出力する

; 【解1】for ループ
; (defun main ()
;   (let* ((n (read))
;          (m (read))
;          (xs (sort (loop repeat n collect (read)) #'<)))
;     (loop for i below n
;           for s = (car xs) then (+ s (nth i xs))
;           until (> s m)
;           finally (princ i))
;     (terpri)))
; (main)

; 【解2】再帰
(defun scanl1 (func lst)
  (if (null lst)
      (error "Empty list provided to scanl1")
      (let ((result (list (car lst))))
        (dolist (item (cdr lst) (reverse result))
          (push (funcall func (car result) item) result)))))
(defun main ()
  (let* ((n (read))
         (m (read))
         (xs (sort (loop repeat n collect (read)) #'<)))
    (princ (length (remove-if-not #'minusp (map 'list (lambda (x) (- x m)) (scanl1 #'+ xs)))))
    (terpri)))
(main)