



"""simple docstring"""
from collections.abc import Sequence

def    _snake_case		(		UpperCamelCase		:	Sequence[float]    ,	UpperCamelCase		:	float		):
 return sum(c * (x**i) for i, c in enumerate(UpperCamelCase		)		)

def    _snake_case		(		UpperCamelCase		:	Sequence[float]    ,	UpperCamelCase		:	float		):
 UpperCAmelCase			:      Any			=			0.0
 for coeff in reversed(UpperCamelCase		):
  UpperCAmelCase			:      Any			=			result * x + coeff
 return result


if __name__ == "__main__":
      A:     Tuple										=	(0.0, 0.0, 5.0, 9.3, 7.0)
      A:     Any										=	10.0
      print(evaluate_poly(poly, x))
      print(horner(poly, x))





"""simple docstring"""
from __future__ import annotations

from collections.abc import Generator

def    _snake_case		(		):
 UpperCAmelCase			:      dict[int, int]			=			{}
 UpperCAmelCase			:      str			=			2
 while True:
  UpperCAmelCase			:      List[str]			=			factor_map.pop(UpperCamelCase    ,	UpperCamelCase		)
  if factor:
   UpperCAmelCase			:      Dict			=			factor + prime
   while x in factor_map:
    x += factor
   UpperCAmelCase			:      Tuple			=			factor
  else:
   UpperCAmelCase			:      Optional[int]			=			prime
   yield prime
  prime += 1

def    _snake_case		(		UpperCamelCase		:	float = 1e1_0		):
 UpperCAmelCase			:      Tuple			=			sieve()

 UpperCAmelCase			:      Optional[Any]			=			1
 while True:
  UpperCAmelCase			:      List[str]			=			next(UpperCamelCase		)
  if (2 * prime * n) > limit:
   return n
  # Ignore the next prime as the reminder will be 2.
  next(UpperCamelCase		)
  n += 2


if __name__ == "__main__":
      print(solution())
