


def        UpperCAmelCase_      (							__snake_case  ,		__snake_case  ,		__snake_case  ,		__snake_case		)  ->    int:







 """simple docstring"""


 _lowercase							   =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(__snake_case  ,		r + 1  ,		__snake_case  ,		__snake_case		)
 else:
  return binary_search(__snake_case  ,		__snake_case  ,		r - 1  ,		__snake_case		)
def        UpperCAmelCase_      (							__snake_case  ,		__snake_case		)  ->    list:







 """simple docstring"""


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


if __name__ == "__main__":
  import doctest

  doctest.testmod()





def        UpperCAmelCase_      (							__snake_case		)  ->    bool:







 """simple docstring"""


 if not isinstance(__snake_case  ,		__snake_case		):
  _lowercase							   =F"Input value of [number={number}] must be an integer"
  raise TypeError(__snake_case		)
 if number < 0 or number % 2 == 1:
  return False
 _lowercase							   =int(number**0.5		)
 return number == number_sqrt * (number_sqrt + 1)


if __name__ == "__main__":
  import doctest

  doctest.testmod()

