




from __future__ import annotations

from random import choice







def 	_a      (						SCREAMING_SNAKE_CASE_							:				List[str]     ):
					return choice(SCREAMING_SNAKE_CASE_     )







def 	_a      (						SCREAMING_SNAKE_CASE_							:				list[int]      ,      SCREAMING_SNAKE_CASE_							:				int     ):
					__lowerCAmelCase				   =       random_pivot(SCREAMING_SNAKE_CASE_     )

					# partition based on pivot
					# linear time
					__lowerCAmelCase				   =       [e for e in lst if e < pivot]
					__lowerCAmelCase				   =       [e for e in lst if e > pivot]

					# if we get lucky, pivot might be the element we want.
					# we can easily see this:
					# small (elements smaller than k)
					# + pivot (kth element)
					# + big (elements larger than k)
					if len(SCREAMING_SNAKE_CASE_     ) == k - 1:
										return pivot
					# pivot is in elements bigger than k
					elif len(SCREAMING_SNAKE_CASE_     ) < k - 1:
										return kth_number(SCREAMING_SNAKE_CASE_      ,      k - len(SCREAMING_SNAKE_CASE_     ) - 1     )
					# pivot is in elements smaller than k
					else:
										return kth_number(SCREAMING_SNAKE_CASE_      ,      SCREAMING_SNAKE_CASE_     )


if __name__ == "__main__":
					import doctest

					doctest.testmod()





"""simple docstring"""






from __future__ import annotations

import numpy as np


def 			UpperCAmelCase__       (				lowerCAmelCase__     :list[float]		) ->    Optional[Any]:
      '''simple docstring'''


      return np.maximum(0					,		lowerCAmelCase__		)


if __name__ == "__main__":
       print(np.array(relu([-1, 0, 5])))  # --> [0, 0, 5]



