input: Write a python function to find all prime numbers in a given list.
  assert find_primes([12, 23, 7, 8, 10, 15]) == [23, 7]
  assert find_primes([1, 2, 3, 4, 5, 6, 7, 8, 9, 10]) == [2, 3, 5, 7]
  assert find_primes([11, 13, 17, 19, 22, 25, 29]) == [11, 13, 17, 19, 29]
output: def find_primes(lst):
      def is_prime(n):
          if n <= 1:
              return False
          for i in range(2, int(n**0.5) + 1):
              if n % i == 0:
                  return False
          return True
      
      return [x for x in lst if is_prime(x)]