

from graphs.minimum_spanning_tree_kruskal import kruskal


def 							__lowerCAmelCase     (							)		->				Optional[Any]:
 '''simple docstring'''


 SCREAMING_SNAKE_CASE		    =      9
 SCREAMING_SNAKE_CASE		    =      [
     [0, 1, 4],
     [0, 7, 8],
     [1, 2, 8],
     [7, 8, 7],
     [7, 6, 1],
     [2, 8, 2],
     [8, 6, 6],
     [2, 3, 7],
     [2, 5, 4],
     [6, 5, 2],
     [3, 5, 14],
     [3, 4, 9],
     [5, 4, 10],
     [1, 7, 11],
 ]

 SCREAMING_SNAKE_CASE		    =      kruskal(_UpperCamelCase		,				_UpperCamelCase						)

 SCREAMING_SNAKE_CASE		    =      [
     [7, 6, 1],
     [2, 8, 2],
     [6, 5, 2],
     [0, 1, 4],
     [2, 5, 4],
     [2, 3, 7],
     [0, 7, 8],
     [3, 4, 9],
 ]

 assert sorted(_UpperCamelCase						) == sorted(_UpperCamelCase						)




import math


def 							__lowerCAmelCase     (							_UpperCamelCase		:	int						)		->				list[int]:
 '''simple docstring'''


 SCREAMING_SNAKE_CASE		    =      []
 SCREAMING_SNAKE_CASE		    =      2
 SCREAMING_SNAKE_CASE		    =      int(math.sqrt(_UpperCamelCase						)						)  # Size of every segment
 SCREAMING_SNAKE_CASE		    =      [True] * (end + 1)
 SCREAMING_SNAKE_CASE		    =      []

 while start <= end:
  if temp[start] is True:
   in_prime.append(_UpperCamelCase						)
   for i in range(start * start		,				end + 1		,				_UpperCamelCase						):
    SCREAMING_SNAKE_CASE		    =      False
  start += 1
 prime += in_prime

 SCREAMING_SNAKE_CASE		    =      end + 1
 SCREAMING_SNAKE_CASE		    =      min(2 * end		,				_UpperCamelCase						)

 while low <= n:
  SCREAMING_SNAKE_CASE		    =      [True] * (high - low + 1)
  for each in in_prime:
   SCREAMING_SNAKE_CASE		    =      math.floor(low / each						) * each
   if t < low:
    t += each

   for j in range(_UpperCamelCase		,				high + 1		,				_UpperCamelCase						):
    SCREAMING_SNAKE_CASE		    =      False

  for j in range(len(_UpperCamelCase						)						):
   if temp[j] is True:
    prime.append(j + low						)

  SCREAMING_SNAKE_CASE		    =      high + 1
  SCREAMING_SNAKE_CASE		    =      min(high + end		,				_UpperCamelCase						)

 return prime




print(sieve(10**6))

