input: Write a python function that takes a list of positive integers and returns a sorted list of elements where none of the elements contain any even digits.
  assert unique_digits([15, 33, 1422, 1]) == [1, 15, 33]
  assert unique_digits([152, 323, 1422, 10]) == []
  assert unique_digits([12345, 2033, 111, 151]) == [111, 151]
  assert unique_digits([135, 103, 31]) == [31, 135]
output: def unique_digits(lst):
      def has_no_even_digit(n):
          return all(int(d) % 2 != 0 for d in str(n))
      
      return sorted([num for num in lst if has_no_even_digit(num)])