

def       snake_case__    (       lowerCAmelCase_,   lowerCAmelCase_,   lowerCAmelCase_,   lowerCAmelCase_      ):





     """simple docstring"""







     SCREAMING_SNAKE_CASE										=int((lower_bound + upper_bound) // 2      )
     if array[r] == value:
          return r
     if lower_bound >= upper_bound:
          return -1
     if array[r] < value:
          return binary_search(lowerCAmelCase_,   r + 1,   lowerCAmelCase_,   lowerCAmelCase_      )
     else:
          return binary_search(lowerCAmelCase_,   lowerCAmelCase_,   r - 1,   lowerCAmelCase_      )







def       snake_case__    (       lowerCAmelCase_,   lowerCAmelCase_      ):





     """simple docstring"""







     SCREAMING_SNAKE_CASE										=0
     if matrix[index][0] == value:
          return [index, 0]
     while index < len(lowerCAmelCase_      ) and matrix[index][0] < value:
          SCREAMING_SNAKE_CASE										=binary_search(matrix[index],   0,   len(matrix[index]      ) - 1,   lowerCAmelCase_      )
          if r != -1:
               return [index, r]
          index += 1
     return [-1, -1]


if __name__ == "__main__":
 import doctest

 doctest.testmod()




def       snake_case__    (       lowerCAmelCase_,   lowerCAmelCase_,   lowerCAmelCase_      ):





     """simple docstring"""







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

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

     return result







def       snake_case__    (       ):





     """simple docstring"""







     print(modular_exponential(3,   200,   13      )      )


if __name__ == "__main__":
 import doctest

 doctest.testmod()

 main()

