Teacher: In this task, you are given an input list A comprising of numbers and alphabets. You need to extract and sort the unique alphabets in the list. The alphabets in the input list will only be in lowercase. Return -1 if there is no alphabet in the input list.
Teacher: Now, understand the problem? If you are still confused, see the following example:
['8129', 'a', '4245', 'y', 'm', 'a']
Solution: a, m, y
Reason: Here, the unique alphabets in the list are 'a', 'y', and 'm', hence their sorted order is 'a, m, y'.

Now, solve this instance: ['e', 'o', '5453', 'e', 's', '5021', '141', 'c', '3373', '8441', 'j', '6453', 'k', 'a', '2579', '2847', 'm', '7267', '6785', 'u', 'e', 'h', 'v', 'g', 'e', 'm', '2123', '7165', 'c', 'k']
Student:

Show your work and conclude with the exact phrasing "Therefore, the final answer is [answer]." where [answer] is just the final number or expression that solves the problem.
user
a, c, e, g, h, j, k, m, o, s, u, v