import Data.List

main :: IO ()
main = do
    l <- readLn :: IO Int
    n <- readLn :: IO Int
    w <- map read . words <$> getLine :: IO [Int]
    print . snd . foldl (\(s,c) w ->
        let s' = s + w
         in if s' <= l then (s',c+1) else (s,c)) (0,0) $ sort w