import Control.Applicative
import qualified Data.IntMap as M
import Data.List
import Data.Array
 
solve n v cs = fst $ M.findMin $ M.filter (ordered . M.elems) $ M.fromList $ last' $ unfoldr next ([(sum cs, M.fromList $ zip [1..n] [1,1..])],0) where
  last' [] = [(sum cs, M.fromList $ zip [1..n] [1,1..])]
  last' xs = last xs
 
  cs' = listArray (1,n) cs
 
  ordered (y:[]) = True
  ordered (x:y:xs) = x >= y && ordered (y:xs)
 
  next (m,i)
    | i >= v - n = Nothing
    | otherwise = Just (m', (m',i+1))
    where
      m' = foldr go [] [1..n]
      go j m0 = foldr
        (\(k,a) b -> (k + cs' ! j, M.insertWith (+) j 1 a) : b) m0
        $ take 10 $ sort $ filter (ordered . M.elems . snd) m
 
main = do
  [n,v] <- fmap (read :: String -> Int) . words <$> getLine
  cs <- fmap (read :: String -> Int) . words <$> getLine
  print $ solve n v cs