





from __future__ import annotations



def    SCREAMING_SNAKE_CASE							(			snake_case	,      snake_case	,      snake_case	,      snake_case       )		->						None:
		__lowercase	,			__lowercase					=    m - 1, 0
		while i >= 0 and j < n:
				if key == mat[i][j]:
						print(F"Key {key} found at row- {i + 1} column- {j + 1}"       )
						return
				if key < mat[i][j]:
						i -= 1
				else:
						j += 1
		print(F"Key {key} not found"       )



def    SCREAMING_SNAKE_CASE							(			)		->						None:
		__lowercase					=    [[2, 5, 7], [4, 8, 13], [9, 11, 15], [12, 17, 20]]
		__lowercase					=    int(input('Enter the element to be searched:'       )       )
		print(snake_case       )
		search_in_a_sorted_matrix(snake_case	,      len(snake_case       )	,      len(mat[0]       )	,      snake_case       )


if __name__ == "__main__":
		import doctest

		doctest.testmod()
		main()











def    SCREAMING_SNAKE_CASE							(			snake_case       )		->						int:
		__lowercase					=    str(snake_case       ).strip()
		if not bin_string:
				raise ValueError('Empty string was passed to the function'       )
		__lowercase					=    bin_string[0] == '-'
		if is_negative:
				__lowercase					=    bin_string[1:]
		if not all(char in '01' for char in bin_string       ):
				raise ValueError('Non-binary value was passed to the function'       )
		__lowercase					=    0
		for char in bin_string:
				__lowercase					=    2 * decimal_number + int(snake_case       )
		return -decimal_number if is_negative else decimal_number


if __name__ == "__main__":
		from doctest import testmod

		testmod()




