



from __future__ import annotations



def  lowercase    (				SCREAMING_SNAKE_CASE__    :		list[list[int]]			,    SCREAMING_SNAKE_CASE__    :		int			,    SCREAMING_SNAKE_CASE__    :		int			,    SCREAMING_SNAKE_CASE__    :		int | float			)					->       None:
 _snake_case		,      _snake_case      :					Optional[Any]					=   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  lowercase    (				)					->       None:
 _snake_case      :					Union[str, Any]					=   [[2, 5, 7], [4, 8, 13], [9, 11, 15], [12, 17, 20]]
 _snake_case      :					Any					=   int(input("""Enter the element to be searched:"""			)			)
 print(SCREAMING_SNAKE_CASE__			)
 search_in_a_sorted_matrix(SCREAMING_SNAKE_CASE__			,    len(SCREAMING_SNAKE_CASE__			)			,    len(mat[0]			)			,    SCREAMING_SNAKE_CASE__			)


if __name__ == "__main__":
  import doctest

  doctest.testmod()
  main()





def  lowercase    (				SCREAMING_SNAKE_CASE__    :		float			,    SCREAMING_SNAKE_CASE__    :		float			)					->       float:
 return a + b


if __name__ == "__main__":
  a__      =		5
  a__      =		6
  print(F'''The sum of {a} + {b} is {add(a, b)}''')
