
"""simple docstring"""


import math






def    _snake_case					(		snake_case__ :  List[Any]  ):
	A     = []
	A     = 2
	A     = int(math.sqrt(__lowerCAmelCase  )  )  # Size of every segment
	A     = [True] * (end + 1)
	A     = []

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

	A     = end + 1
	A     = min(2 * end						,   __lowerCAmelCase  )

	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(__lowerCAmelCase						,   high + 1						,   __lowerCAmelCase  ):
				A     = False

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

		A     = high + 1
		A     = min(high + end						,   __lowerCAmelCase  )

	return prime


print(sieve(10**6))




from __future__ import annotations

import numpy as np

def        __a			(   __lowerCAmelCase   )     ->     Optional[Any]:
					return np.maximum(0      ,	__lowerCAmelCase   )


if __name__ == "__main__":
			print(np.array(relu([-1, 0, 5])))  # --> [0, 0, 5]