




from collections import namedtuple

UpperCamelCase__            =     namedtuple("""from_to""", """from_ to""")

UpperCamelCase__            =     {
    """millimeter""": """mm""",
    """centimeter""": """cm""",
    """meter""": """m""",
    """kilometer""": """km""",
    """inch""": """in""",
    """inche""": """in""",  # Trailing 's' has been stripped off
    """feet""": """ft""",
    """foot""": """ft""",
    """yard""": """yd""",
    """mile""": """mi""",
}

UpperCamelCase__            =     {
    """mm""": from_to(0.001, 1000),
    """cm""": from_to(0.01, 100),
    """m""": from_to(1, 1),
    """km""": from_to(1000, 0.001),
    """in""": from_to(0.0254, 39.3701),
    """ft""": from_to(0.3048, 3.28084),
    """yd""": from_to(0.9144, 1.09361),
    """mi""": from_to(1609.34, 0.000621371),
}







def       _a (		SCREAMING_SNAKE_CASE_				:							Optional[int] , SCREAMING_SNAKE_CASE_				:							List[Any] , SCREAMING_SNAKE_CASE_				:							List[str]	):
					__lowerCAmelCase							  =			from_type.lower().rstrip("s"	)
					__lowerCAmelCase							  =			TYPE_CONVERSION.get(lowerCamelCase__ , lowerCamelCase__	)
					__lowerCAmelCase							  =			to_type.lower().rstrip("s"	)
					__lowerCAmelCase							  =			TYPE_CONVERSION.get(lowerCamelCase__ , lowerCamelCase__	)
					if new_from not in METRIC_CONVERSION:
										__lowerCAmelCase							  =			(
										    F"""Invalid \'from_type\' value: {from_type!r}.\n"""
										    F"""Conversion abbreviations are: {', '.join(lowerCamelCase__	)}"""
										)
										raise ValueError(lowerCamelCase__	)
					if new_to not in METRIC_CONVERSION:
										__lowerCAmelCase							  =			(
										    F"""Invalid \'to_type\' value: {to_type!r}.\n"""
										    F"""Conversion abbreviations are: {', '.join(lowerCamelCase__	)}"""
										)
										raise ValueError(lowerCamelCase__	)
					return value * METRIC_CONVERSION[new_from].from_ * METRIC_CONVERSION[new_to].to


if __name__ == "__main__":
					import doctest

					doctest.testmod()












import math




class 	lowerCamelCase__				:






      def __init__(self					:    int		,		_snake_case					:    Dict		)       ->   Union[str, Any]:


       """simple docstring"""






       lowerCamelCase_							:    Optional[Any]							=     len(_snake_case		)
       lowerCamelCase_							:    Optional[Any]							=     [0] * (
           4 * self.N
       )  # approximate the overall size of segment tree with array N
       self.build(1		,		0		,		self.N - 1		)






      def      UpperCAmelCase_     (self					:    List[str]		,		_snake_case					:    List[str]		)       ->   int:


       """simple docstring"""






       return idx * 2






      def      UpperCAmelCase_     (self					:    Tuple		,		_snake_case					:    Dict		)       ->   Optional[Any]:


       """simple docstring"""






       return idx * 2 + 1






      def      UpperCAmelCase_     (self					:    List[Any]		,		_snake_case					:    List[Any]		,		_snake_case					:    str		,		_snake_case					:    List[Any]		)       ->   Optional[Any]:  # noqa: E741


       """simple docstring"""






       if l == r:
        lowerCamelCase_							:    List[Any]							=     A[l]
       else:
        lowerCamelCase_							:    int							=     (l + r) // 2
        self.build(self.left(_snake_case		)		,		_snake_case		,		_snake_case		)
        self.build(self.right(_snake_case		)		,		mid + 1		,		_snake_case		)
        lowerCamelCase_							:    Tuple							=     max(self.st[self.left(_snake_case		)]		,		self.st[self.right(_snake_case		)]		)






      def      UpperCAmelCase_     (self					:    str		,		_snake_case					:    Tuple		,		_snake_case					:    Any		,		_snake_case					:    str		)       ->   Tuple:


       """simple docstring"""






       return self.update_recursive(1		,		0		,		self.N - 1		,		a - 1		,		b - 1		,		_snake_case		)






      def      UpperCAmelCase_     (self					:    Tuple		,		_snake_case					:    List[str]		,		_snake_case					:    Tuple		,		_snake_case					:    Optional[int]		,		_snake_case					:    int		,		_snake_case					:    Tuple		,		_snake_case					:    List[str]		)       ->   Optional[Any]:  # noqa: E741


       """simple docstring"""






       if r < a or l > b:
        return True
       if l == r:
        lowerCamelCase_							:    Tuple							=     val
        return True
       lowerCamelCase_							:    Optional[int]							=     (l + r) // 2
       self.update_recursive(self.left(_snake_case		)		,		_snake_case		,		_snake_case		,		_snake_case		,		_snake_case		,		_snake_case		)
       self.update_recursive(self.right(_snake_case		)		,		mid + 1		,		_snake_case		,		_snake_case		,		_snake_case		,		_snake_case		)
       lowerCamelCase_							:    Union[str, Any]							=     max(self.st[self.left(_snake_case		)]		,		self.st[self.right(_snake_case		)]		)
       return True






      def      UpperCAmelCase_     (self					:    List[Any]		,		_snake_case					:    List[Any]		,		_snake_case					:    Optional[int]		)       ->   str:


       """simple docstring"""






       return self.query_recursive(1		,		0		,		self.N - 1		,		a - 1		,		b - 1		)






      def      UpperCAmelCase_     (self					:    Any		,		_snake_case					:    List[Any]		,		_snake_case					:    Optional[Any]		,		_snake_case					:    int		,		_snake_case					:    Optional[int]		,		_snake_case					:    Optional[Any]		)       ->   str:  # noqa: E741


       """simple docstring"""






       if r < a or l > b:
        return -math.inf
       if l >= a and r <= b:
        return self.st[idx]
       lowerCamelCase_							:    int							=     (l + r) // 2
       lowerCamelCase_							:    Optional[Any]							=     self.query_recursive(self.left(_snake_case		)		,		_snake_case		,		_snake_case		,		_snake_case		,		_snake_case		)
       lowerCamelCase_							:    Union[str, Any]							=     self.query_recursive(self.right(_snake_case		)		,		mid + 1		,		_snake_case		,		_snake_case		,		_snake_case		)
       return max(_snake_case		,		_snake_case		)






      def      UpperCAmelCase_     (self					:    str		)       ->   Tuple:


       """simple docstring"""






       lowerCamelCase_							:    Dict							=     []
       for i in range(1		,		N + 1		):
        show_list += [self.query(_snake_case		,		_snake_case		)]
       print(_snake_case		)


if __name__ == "__main__":
       UpperCamelCase											=      [1, 2, -4, 7, 3, -5, 6, 1_1, -2_0, 9, 1_4, 1_5, 5, 2, -8]
       UpperCamelCase											=      1_5
       UpperCamelCase											=      SegmentTree(A)
       print(segt.query(4, 6))
       print(segt.query(7, 1_1))
       print(segt.query(7, 1_2))
       segt.update(1, 3, 1_1_1)
       print(segt.query(1, 1_5))
       segt.update(7, 8, 2_3_5)
       segt.show_data()
