






def      _SCREAMING_SNAKE_CASE  (	__lowercase				:     Optional[Any]     ,			__lowercase				:     List[Any]     ,			__lowercase				:     Union[str, Any]      )  -> int:





     """simple docstring"""

     if power < 0:
          return -1
     base %= mod
     __A             =		1

     while power > 0:
          if power & 1:
               __A             =		(result * base) % mod
          __A             =		power >> 1
          __A             =		(base * base) % mod

     return result



def      _SCREAMING_SNAKE_CASE  (	)  -> Any:





     """simple docstring"""

     print(modular_exponential(3     ,			2_0_0     ,			1_3      )      )


if __name__ == "__main__":
  import doctest

  doctest.testmod()

  main()












def      _SCREAMING_SNAKE_CASE  (	__lowercase				:     list[int]      )  -> list[int]:





    """simple docstring"""

    if len(__lowercase      ) > 1:
        __A             =		len(__lowercase      ) // 2  # Finds the middle of the array
        __A             =		arr[
            :middle_length
        ]  # Creates an array of the elements in the first half.
        __A             =		arr[
            middle_length:
        ]  # Creates an array of the elements in the second half.
        __A             =		len(__lowercase      )
        __A             =		len(__lowercase      )
        merge(__lowercase      )  # Starts sorting the left.
        merge(__lowercase      )  # Starts sorting the right
        __A             =		0  # Left Counter
        __A             =		0  # Right Counter
        __A             =		0  # Position Counter
        while (
            left_index < left_size and right_index < right_size
        ):  # Runs until the lowers size of the left and right are sorted.
            if left_array[left_index] < right_array[right_index]:
                __A             =		left_array[left_index]
                left_index += 1
            else:
                __A             =		right_array[right_index]
                right_index += 1
            index += 1
        while (
            left_index < left_size
        ):  # Adds the left over elements in the left half of the array
            __A             =		left_array[left_index]
            left_index += 1
            index += 1
        while (
            right_index < right_size
        ):  # Adds the left over elements in the right half of the array
            __A             =		right_array[right_index]
            right_index += 1
            index += 1
    return arr


if __name__ == "__main__":
  import doctest

  doctest.testmod()




