






import os
from math import logaa






def     _snake_case			(__lowercase = "base_exp.txt"):
   UpperCamelCase_									=     0
   UpperCamelCase_									=     0
   for i, line in enumerate(open(os.path.join(os.path.dirname(__lowercase)    ,      __lowercase))):
      UpperCamelCase_		,      UpperCamelCase_									=     list(map(__lowercase    ,      line.split(',')))
      if x * logaa(__lowercase) > largest:
         UpperCamelCase_									=     x * logaa(__lowercase)
         UpperCamelCase_									=     i + 1
   return result


if __name__ == "__main__":
 print(solution())













snake_case__      :	List[Any]       	=      """Tobias Carryer"""

from time import time


class 						_a       :






  """simple docstring"""





  def __init__(     self		,		_UpperCAmelCase		,		_UpperCAmelCase		,		_UpperCAmelCase		,		_UpperCAmelCase=int(time() ) )			-> Tuple:  # noqa: B008
     UpperCamelCase_									=     multiplier
     UpperCamelCase_									=     increment
     UpperCamelCase_									=     modulo
     UpperCamelCase_									=     seed




  def    _UpperCAmelCase     (     self )			-> Any:
     UpperCamelCase_									=     (self.multiplier * self.seed + self.increment) % self.modulo
     return self.seed


if __name__ == "__main__":
 # Show the LCG in action.
 snake_case__      :	List[Any]       	=      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())





