'''simple docstring'''




__UpperCAmelCase					="Tobias Carryer"

from time import time




class        a__ :






     def __init__(					self						:						Dict    ,							a						:						Optional[Any]    ,							a						:						Optional[Any]    ,							a						:						str    ,							a						:						Optional[int]=int(time()       )       ):  # noqa: B008





         """simple docstring"""



         __lowerCamelCase            =    multiplier
         __lowerCamelCase            =    increment
         __lowerCamelCase            =    modulo
         __lowerCamelCase            =    seed






     def   SCREAMING_SNAKE_CASE__  (					self						:						List[Any]       ):





         """simple docstring"""



         __lowerCamelCase            =    (self.multiplier * self.seed + self.increment) % self.modulo
         return self.seed


if __name__ == "__main__":
  # Show the LCG in action.
  __UpperCAmelCase					=LinearCongruentialGenerator(1_6_6_4_5_2_5, 1_0_1_3_9_0_4_2_2_3, 2 << 3_1)
  while True:
    print(lcg.next_number())


__lowerCamelCase				=			"""Tobias Carryer"""

from time import time






class     UpperCAmelCase						:



   def __init__(self						:   Dict       ,		snake_case__						:   Optional[Any]       ,		snake_case__						:   Optional[Any]       ,		snake_case__						:   str       ,		snake_case__						:   Optional[int]=int(time()					)					)						->      List[Any]:  # noqa: B008


          '''simple docstring'''


          snake_case			:  Dict     							= multiplier
          snake_case			:  Dict     							= increment
          snake_case			:  Union[str, Any]     							= modulo
          snake_case			:  Tuple     							= seed



   def 							_SCREAMING_SNAKE_CASE  (self						:   List[Any]					)						->      Any:


          '''simple docstring'''


          snake_case			:  Optional[int]     							= (self.multiplier * self.seed + self.increment) % self.modulo
          return self.seed


if __name__ == "__main__":
   # Show the LCG in action.
   __lowerCamelCase				=			LinearCongruentialGenerator(1_66_45_25, 10_13_90_42_23, 2 << 31)
   while True:
      print(lcg.next_number())





