"""simple docstring"""



from collections import namedtuple

SCREAMING_SNAKE_CASE__:List[str]			=	namedtuple("""from_to""", """from_ to""")

SCREAMING_SNAKE_CASE__:int			=	{
    """cubicmeter""": from_to(1, 1),
    """litre""": from_to(0.001, 1000),
    """kilolitre""": from_to(1, 1),
    """gallon""": from_to(0.00_454, 264.172),
    """cubicyard""": from_to(0.76_455, 1.30_795),
    """cubicfoot""": from_to(0.028, 35.3_147),
    """cup""": from_to(0.000_236_588, 4_226.75),
}



def 					_lowerCamelCase(					a ,  a ,  a							):
       if from_type not in METRIC_CONVERSION:
              raise ValueError(
                  F"Invalid 'from_type' value: {from_type!r}  Supported values are:\n"
                  + ", ".join(a							)							)
       if to_type not in METRIC_CONVERSION:
              raise ValueError(
                  F"Invalid 'to_type' value: {to_type!r}.  Supported values are:\n"
                  + ", ".join(a							)							)
       return value * METRIC_CONVERSION[from_type].from_ * METRIC_CONVERSION[to_type].to


if __name__ == "__main__":
   import doctest

   doctest.testmod()

"""simple docstring"""



import math



def 					_lowerCamelCase(					a							):
       __a     				=  []
       __a     				=  2
       __a     				=  int(math.sqrt(a							)							)  # Size of every segment
       __a     				=  [True] * (end + 1)
       __a     				=  []

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

       __a     				=  end + 1
       __a     				=  min(2 * end ,  a							)

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

                     for j in range(a ,  high + 1 ,  a							):
                            __a     				=  False

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

              __a     				=  high + 1
              __a     				=  min(high + end ,  a							)

       return prime




print(sieve(10**6))
