You will be given a definition of a task first, then an example. Follow the example to solve a new instance of the task.
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.

['8129', 'a', '4245', 'y', 'm', 'a']
Solution: a, m, y
Why? Here, the unique alphabets in the list are 'a', 'y', and 'm', hence their sorted order is 'a, m, y'.

New input: ['d', '327', '8319', 'a', 'e', 'm', '4183', 'p', '4715', 'h', '6453', '9723', '9693', '4665', '9447', 'a', 'v', '6963', 'w', 'p', 'z', 'b', 'q', '4639', 'r', 'k', '8073', '9173', '6467', '5731', 't', 'o', 'o', '347']
Solution:
a, b, d, e, h, k, m, o, p, q, r, t, v, w, z