


'''simple docstring'''







from __future__ import annotations







def _UpperCamelCase	(					__A				,      __A				,      __A				,      __A   )							->		None:


      '''simple docstring'''



      UpperCamelCase__ ,     UpperCamelCase__  =    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 _UpperCamelCase	(					)							->		None:


      '''simple docstring'''



      UpperCamelCase__  =    [[2, 5, 7], [4, 8, 13], [9, 11, 15], [12, 17, 20]]
      UpperCamelCase__  =    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'''







from itertools import permutations







def _UpperCamelCase	(					)							->		Optional[int]:


      '''simple docstring'''



      UpperCamelCase__  =    list(map("".join				,      permutations("0123456789"   )   )   )
      return result[999999]


if __name__ == "__main__":
  print(solution())





