


'''simple docstring'''
from __future__ import annotations







def 			a_							(  UpperCamelCase_	,     UpperCamelCase_	,     UpperCamelCase_	,     UpperCamelCase_   ):
							A_						,				A_ 						=		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 			a_							(  ):
							A_ 						=		[[2, 5, 7], [4, 8, 1_3], [9, 1_1, 1_5], [1_2, 1_7, 2_0]]
							A_ 						=		int(input("Enter the element to be searched:"   )   )
							print(UpperCamelCase_   )
							search_in_a_sorted_matrix(UpperCamelCase_	,     len(UpperCamelCase_   )	,     len(mat[0]   )	,     UpperCamelCase_   )


if __name__ == "__main__":
							import doctest

							doctest.testmod()
							main()









'''simple docstring'''
def 			a_							(  UpperCamelCase_   ):
							if not isinstance(UpperCamelCase_	,     UpperCamelCase_   ):
														A_ 						=		f"Input value of [number={number}] must be an integer"
														raise TypeError(UpperCamelCase_   )
							if number < 0 or number % 2 == 1:
														return False
							A_ 						=		int(number**0.5   )
							return number == number_sqrt * (number_sqrt + 1)


if __name__ == "__main__":
							import doctest

							doctest.testmod()





