




def       SCREAMING_SNAKE_CASE			( __UpperCamelCase    :		list ,  __UpperCamelCase    :		int ,  __UpperCamelCase    :		int ,  __UpperCamelCase    :		int   )						->							int:
    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(__UpperCamelCase ,  r + 1 ,  __UpperCamelCase ,  __UpperCamelCase   )
    else:
        return binary_search(__UpperCamelCase ,  __UpperCamelCase ,  r - 1 ,  __UpperCamelCase   )




def       SCREAMING_SNAKE_CASE			( __UpperCamelCase    :		int ,  __UpperCamelCase    :		list   )						->							list:
    UpperCAmelCase_											=  0
    if matrix[index][0] == value:
        return [index, 0]
    while index < len(__UpperCamelCase   ) and matrix[index][0] < value:
        UpperCAmelCase_											=  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()











import decimal




def       SCREAMING_SNAKE_CASE			( )						->							int:
    UpperCAmelCase_											=  0
    UpperCAmelCase_											=  decimal.Context(prec=105   )
    for i in range(2 ,  100   ):
        UpperCAmelCase_											=  decimal.Decimal(__UpperCamelCase   )
        UpperCAmelCase_											=  number.sqrt(__UpperCamelCase   )
        if len(str(__UpperCamelCase   )   ) > 1:
            answer += int(str(__UpperCamelCase   )[0]   )
            UpperCAmelCase_											=  str(__UpperCamelCase   )[2:101]
            answer += sum(int(__UpperCamelCase   ) for x in sqrt_number_str   )
    return answer


if __name__ == "__main__":
 import doctest

 doctest.testmod()
 print(F"{solution() = }")





