Using Haskell

Create a function named second_a that uses a list comprehension. The function will take a single integer parameter n. Find every number from 1 to n (inclusive) that is a palindrome which starts with the digit 3. Do not user a helper function.