




def 						lowercase		(     _lowerCAmelCase   ,     _lowerCAmelCase   ,     _lowerCAmelCase   ,     _lowerCAmelCase      ):
  UpperCAmelCase__    						=   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 						lowercase		(     _lowerCAmelCase   ,     _lowerCAmelCase      ):
  UpperCAmelCase__    						=   0
  if matrix[index][0] == value:
    return [index, 0]
  while index < len(_lowerCAmelCase      ) and matrix[index][0] < value:
    UpperCAmelCase__    						=   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 						lowercase		(     _lowerCAmelCase      ):
  UpperCAmelCase__    						=   5381
  for x in s:
    UpperCAmelCase__    						=   ((hash_value << 5) + hash_value) + ord(_lowerCAmelCase      )
  return hash_value & 0xffffffff




