'''simple docstring'''


from __future__ import annotations


def  _lowerCamelCase   (				lowerCamelCase_ :							list     ,					lowerCamelCase_ :							int | None = None     ,					lowerCamelCase_ :							int | None = None       ):



     """simple docstring"""





     if start is None:
          UpperCAmelCase_							:       Optional[Any]       =				0

     if end is None:
          UpperCAmelCase_							:       Optional[int]       =				len(lowerCamelCase_       ) - 1

     if start >= end:
          return

     UpperCAmelCase_							:       Optional[int]       =				(start + end) // 2

     slowsort(lowerCamelCase_     ,					lowerCamelCase_     ,					lowerCamelCase_       )
     slowsort(lowerCamelCase_     ,					mid + 1     ,					lowerCamelCase_       )

     if sequence[end] < sequence[mid]:
          UpperCAmelCase_       ,      UpperCAmelCase_							:       List[str]       =				sequence[mid], sequence[end]

     slowsort(lowerCamelCase_     ,					lowerCamelCase_     ,					end - 1       )


if __name__ == "__main__":
 from doctest import testmod

 testmod()







'''simple docstring'''


snake_case__					:      str				      =  '''Tobias Carryer'''

from time import time






class 					__SCREAMING_SNAKE_CASE						:







  '''simple docstring'''






  def __init__(			self				,		snake_case_				,		snake_case_				,		snake_case_				,		snake_case_=int(time()						)						):  # noqa: B008




       '''simple docstring'''

       UpperCAmelCase_							:       str       =				multiplier
       UpperCAmelCase_							:       Dict       =				increment
       UpperCAmelCase_							:       Tuple       =				modulo
       UpperCAmelCase_							:       Dict       =				seed






  def _UpperCamelCase					(			self						):




       '''simple docstring'''

       UpperCAmelCase_							:       Union[str, Any]       =				(self.multiplier * self.seed + self.increment) % self.modulo
       return self.seed


if __name__ == "__main__":
 # Show the LCG in action.
 snake_case__					:      Any				      =  LinearCongruentialGenerator(166_4525, 10_1390_4223, 2 << 31)
 while True:
  print(lcg.next_number())






