





from __future__ import annotations


def        A__						(							SCREAMING_SNAKE_CASE_				,							SCREAMING_SNAKE_CASE_				,							SCREAMING_SNAKE_CASE_				,							SCREAMING_SNAKE_CASE_		) ->  None:
		lowerCamelCase		, lowerCamelCase :			List[str]    		=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__						(							) ->  None:
		lowerCamelCase :			Any    		=[[2, 5, 7], [4, 8, 1_3], [9, 1_1, 1_5], [1_2, 1_7, 2_0]]
		lowerCamelCase :			str    		=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()







from __future__ import annotations





def 							lowerCamelCase    (							UpperCAmelCase_	:      list[int | float]      )->			int | float:

       """simple docstring"""




       if len(UpperCAmelCase_      ) == 0:
              raise ValueError("""find_min() arg is an empty sequence"""      )
       a			   =nums[0]
       for num in nums:
              a			   =min(UpperCAmelCase_   ,       UpperCAmelCase_      )
       return min_num


if __name__ == "__main__":
    import doctest

    doctest.testmod(verbose=True)
