
'''simple docstring'''





def 							snake_case				(		UpperCAmelCase   ,	UpperCAmelCase   ,	UpperCAmelCase   ,	UpperCAmelCase						)->      int:







      """simple docstring"""
      __A													=      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(UpperCAmelCase   ,	r + 1   ,	UpperCAmelCase   ,	UpperCAmelCase						)
      else:
            return binary_search(UpperCAmelCase   ,	UpperCAmelCase   ,	r - 1   ,	UpperCAmelCase						)





def 							snake_case				(		UpperCAmelCase   ,	UpperCAmelCase						)->      list:







      """simple docstring"""
      __A													=      0
      if matrix[index][0] == value:
            return [index, 0]
      while index < len(UpperCAmelCase						) and matrix[index][0] < value:
            __A													=      binary_search(matrix[index]   ,	0   ,	len(matrix[index]						) - 1   ,	UpperCAmelCase						)
            if r != -1:
                  return [index, r]
            index += 1
      return [-1, -1]


if __name__ == "__main__":
 import doctest

 doctest.testmod()













def        __SCREAMING_SNAKE_CASE	(				__lowercase:		int):



  '''simple docstring'''






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


if __name__ == "__main__":
      import doctest

      doctest.testmod()
