from __future__ import annotations



def 			__SCREAMING_SNAKE_CASE						(      __UpperCamelCase					: list[int]				,  __UpperCamelCase					: int			)							->      int:







  """simple docstring"""





  if len(__UpperCamelCase			) < k or k < 0:
    raise ValueError("""Invalid Input"""			)
  SCREAMING_SNAKE_CASE__    							=   SCREAMING_SNAKE_CASE__    							=   sum(array[:k]			)
  for i in range(len(__UpperCamelCase			) - k			):
    SCREAMING_SNAKE_CASE__    							=   current_sum - array[i] + array[i + k]
    SCREAMING_SNAKE_CASE__    							=   max(__UpperCamelCase				,  __UpperCamelCase			)
  return max_sum


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

   testmod()
   __lowerCamelCase    :				int							     =	[randint(-1000, 1000) for i in range(100)]
   __lowerCamelCase    :				List[str]							     =	randint(0, 110)
   print(F"""The maximum sum of {k} consecutive elements is {max_sum_in_array(array,k)}""")

from math import isqrt



def 			__SCREAMING_SNAKE_CASE						(      __UpperCamelCase					: int			)							->      bool:







  """simple docstring"""





  return all(number % divisor != 0 for divisor in range(2				,  isqrt(__UpperCamelCase			) + 1			)			)



def 			__SCREAMING_SNAKE_CASE						(      __UpperCamelCase					: int = 10**6			)							->      int:







  """simple docstring"""





  SCREAMING_SNAKE_CASE__    							=   0
  SCREAMING_SNAKE_CASE__    							=   1
  SCREAMING_SNAKE_CASE__    							=   7
  while prime_candidate < max_prime:
    primes_count += is_prime(__UpperCamelCase			)

    cube_index += 1
    prime_candidate += 6 * cube_index

  return primes_count


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