



class    __lowerCAmelCase					:




				def __init__(				self						):



									"""simple docstring"""





									_lowerCAmelCase         =       []
									_lowerCAmelCase         =       0
									_lowerCAmelCase         =       0




				def __str__(				self						):



									"""simple docstring"""





									_lowerCAmelCase         =       """<""" + str(self.entries						)[1:-1] + """>"""
									return printed




				def 				snake_case  (				self		,							_snake_case						):



									"""simple docstring"""





									self.entries.append(_snake_case						)
									_lowerCAmelCase         =       self.length + 1




				def 				snake_case  (				self						):



									"""simple docstring"""





									_lowerCAmelCase         =       self.length - 1
									_lowerCAmelCase         =       self.entries[self.front]
									# self.front-=1
									# self.entries = self.entries[self.front:]
									_lowerCAmelCase         =       self.entries[1:]
									return dequeued




				def 				snake_case  (				self		,							_snake_case						):



									"""simple docstring"""





									for _ in range(_snake_case						):
														self.put(self.get()						)




				def 				snake_case  (				self						):



									"""simple docstring"""





									return self.entries[0]




				def 				snake_case  (				self						):



									"""simple docstring"""





									return self.length










def  A					(				UpperCAmelCase	,	UpperCAmelCase					):
					# "Simpson Rule"
					# int(f) = delta_x/2 * (b-a)/3*(f1 + 4f2 + 2f_3 + ... + fn)
					_snake_case							:       List[str]												= (boundary[1] - boundary[0]) / steps
					_snake_case							:       List[Any]												= boundary[0]
					_snake_case							:       Tuple												= boundary[1]
					_snake_case							:       str												= make_points(UpperCAmelCase	,	UpperCAmelCase	,	UpperCAmelCase					)
					_snake_case							:       str												= 0.0
					y += (h / 3.0) * f(UpperCAmelCase					)
					_snake_case							:       Tuple												= 2
					for i in x_i:
										y += (h / 3) * (4 - 2 * (cnt % 2)) * f(UpperCAmelCase					)
										cnt += 1
					y += (h / 3.0) * f(UpperCAmelCase					)
					return y







def  A					(				UpperCAmelCase	,	UpperCAmelCase	,	UpperCAmelCase					):
					_snake_case							:       Union[str, Any]												= a + h
					while x < (b - h):
										yield x
										_snake_case							:       Optional[Any]												= x + h







def  A					(				UpperCAmelCase					):  # enter your function here
					_snake_case							:       Dict												= (x - 0) * (x - 0)
					return y







def  A					(				):
					_snake_case							:       int												= 0.0  # Lower bound of integration
					_snake_case							:       Union[str, Any]												= 1.0  # Upper bound of integration
					_snake_case							:       List[str]												= 1_0.0  # define number of steps or resolution
					_snake_case							:       Optional[int]												= [a, b]  # define boundary of integration
					_snake_case							:       List[str]												= method_a(UpperCAmelCase	,	UpperCAmelCase					)
					print(F"""y = {y}"""					)


if __name__ == "__main__":
							main()