from __future__ import annotations



def   __A		(			_A							,				_A					):



 """simple docstring"""


 if b == 0:
  return (1, 0)
 (__a)       =  extended_euclid(snake_case_							,				a % b					)
 __a       =  a // b
 return (y, x - k * y)



def   __A		(			_A							,				_A							,				_A							,				_A					):



 """simple docstring"""


 (__a)       =  extended_euclid(snake_case_							,				snake_case_					)
 __a       =  na * na
 __a       =  ra * x * na + ra * y * na
 return (n % m + m) % m



def   __A		(			_A							,				_A					):



 """simple docstring"""


 (__a)       =  extended_euclid(snake_case_							,				snake_case_					)
 if b < 0:
  __a       =  (b % n + n) % n
 return b



def   __A		(			_A							,				_A							,				_A							,				_A					):



 """simple docstring"""


 __a       =  invert_modulo(snake_case_							,				snake_case_					), invert_modulo(snake_case_							,				snake_case_					)
 __a       =  na * na
 __a       =  ra * x * na + ra * y * na
 return (n % m + m) % m


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

  testmod(name="""chinese_remainder_theorem""", verbose=True)
  testmod(name="""chinese_remainder_theorem2""", verbose=True)
  testmod(name="""invert_modulo""", verbose=True)
  testmod(name="""extended_euclid""", verbose=True)



from __future__ import annotations



def   __A		(			_A					):



 """simple docstring"""


 __a       =  [True] * limit
 __a       =  False
 __a       =  False
 __a       =  True

 for i in range(3							,				int(limit**0.5 + 1					)							,				2					):
  __a       =  i * 2
  while index < limit:
   __a       =  False
   __a       =  index + i

 __a       =  [2]

 for i in range(3							,				_A							,				2					):
  if is_prime[i]:
   primes.append(_A					)

 return primes



def   __A		(			_A = 100_0000					):



 """simple docstring"""


 __a       =  prime_sieve(_A					)
 __a       =  0
 __a       =  0

 for i in range(len(_A					)					):
  for j in range(i + length							,				len(_A					)					):
   __a       =  sum(primes[i:j]					)
   if sol >= ceiling:
    break

   if sol in primes:
    __a       =  j - i
    __a       =  sol

 return largest


if __name__ == "__main__":
  print(f'''{solution() = }''')


