





"""simple docstring"""




from __future__ import annotations





def  a_       (							_lowercase ,		_lowercase ,		_lowercase ,		_lowercase     ):
						_UpperCamelCase    :      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  a_       (							):
						_UpperCamelCase    :      int						     =					[[2, 5, 7], [4, 8, 13], [9, 11, 15], [12, 17, 20]]
						_UpperCamelCase    :      List[str]						     =					int(input('''Enter the element to be searched:'''     )     )
						print(__a     )
						search_in_a_sorted_matrix(__a ,		len(__a     ) ,		len(mat[0]     ) ,		__a     )


if __name__ == "__main__":
			import doctest

			doctest.testmod()
			main()










"""simple docstring"""




def  a_       (							_lowercase ,		_lowercase     ):
						sequence.append(_lowercase     )

						_UpperCamelCase    :      int						     =					0
						while sequence[index] != target:
												index += 1

						sequence.pop()

						if index == len(_lowercase     ):
												return None

						return index


if __name__ == "__main__":
						UpperCamelCase_     =input("""Enter numbers separated by comma:\n""").strip()
						UpperCamelCase_     =[int(item) for item in user_input.split(""",""")]

						UpperCamelCase_     =input("""Enter a single number to be found in the list:\n""")
						UpperCamelCase_     =int(target_input)
						UpperCamelCase_     =sentinel_linear_search(sequence, target)
						if result is not None:
												print(F"{target} found at positions: {result}")
						else:
												print("""Not found""")



