





"""simple docstring"""



a_			=      """Tobias Carryer"""

from time import time






class 		__snake_case :





 """simple docstring"""


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



     '''simple docstring'''




     __A   :						Union[str, Any]									=					multiplier
     __A   :						Optional[int]									=					increment
     __A   :						Optional[int]									=					modulo
     __A   :						int									=					seed







 def  UpperCamelCase__(   self  ):



     '''simple docstring'''




     __A   :						Dict									=					(self.multiplier * self.seed + self.increment) % self.modulo
     return self.seed


if __name__ == "__main__":
       # Show the LCG in action.
       a_			=      LinearCongruentialGenerator(1664525, 1013904223, 2 << 31)
       while True:
              print(lcg.next_number())










"""simple docstring"""



from math import factorial







def 		__lowercase					(       snake_case_  :  int    ,snake_case_  :  int						)       ->int:



    '''simple docstring'''







    if n < k or k < 0:
        raise ValueError('''Please enter positive integers for n and k where n >= k'''						)
    return factorial(snake_case_						) // (factorial(snake_case_						) * factorial(n - k						))


if __name__ == "__main__":
       print(
           """The number of five-card hands possible from a standard""",
           f'''fifty-two card deck is: {combinations(52, 5)}\n''',
       )

       print(
           """If a class of 40 students must be arranged into groups of""",
           f'''4 for group projects, there are {combinations(40, 4)} ways''',
           """to arrange them.\n""",
       )

       print(
           """If 10 teams are competing in a Formula One race, there""",
           f'''are {combinations(10, 3)} ways that first, second and''',
           """third place can be awarded.""",
       )




