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: ['n', 'h', 'k', '1453', 'f', '3641', 'l', '3445', 'e', 'h', '5679', '477', '51', 'a', '4465', '235', '975', 'a', 'j', 'o', 'f', 'j', 'b', '5415', 'z', 'p', '6985', 't', 'q', '1755', '7377', '2467', '5669', '3055', '6679', '3571', '3647', '635', '5387', '7991', '5711', '4297']
Solution:
a, b, e, f, h, j, k, l, n, o, p, q, t, z