



def 		a__      (		_UpperCamelCase      :			int			,_UpperCamelCase      :			int				):
   if b == 0:
      return 1
   if (b % 2) == 0:
      return actual_power(_UpperCamelCase			,int(b / 2				)				) * actual_power(_UpperCamelCase			,int(b / 2				)				)
   else:
      return a * actual_power(_UpperCamelCase			,int(b / 2				)				) * actual_power(_UpperCamelCase			,int(b / 2				)				)





def 		a__      (		_UpperCamelCase      :			int			,_UpperCamelCase      :			int				):
   if b < 0:
      return 1 / actual_power(_UpperCamelCase			,_UpperCamelCase				)
   return actual_power(_UpperCamelCase			,_UpperCamelCase				)


if __name__ == "__main__":
  print(power(-2, -3))











def 		a__      (		_UpperCamelCase      :			list[int]				):
   if not numbers:
      return 0

   if not isinstance(_UpperCamelCase			,(list, tuple)				) or not all(
       isinstance(_UpperCamelCase			,_UpperCamelCase				) for number in numbers				):
      raise ValueError('''numbers must be an iterable of integers'''				)

   __lowerCamelCase    				=     __lowerCamelCase    				=     __lowerCamelCase    				=     numbers[0]

   for i in range(1			,len(_UpperCamelCase				)				):
      # update the maximum and minimum subarray products
      __lowerCamelCase    				=     numbers[i]
      if number < 0:
         __lowerCamelCase				,__lowerCamelCase    				=     min_till_now, max_till_now
      __lowerCamelCase    				=     max(_UpperCamelCase			,max_till_now * number				)
      __lowerCamelCase    				=     min(_UpperCamelCase			,min_till_now * number				)

      # update the maximum product found till now
      __lowerCamelCase    				=     max(_UpperCamelCase			,_UpperCamelCase				)

   return max_prod






