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.
One example: ['8129', 'a', '4245', 'y', 'm', 'a']
Solution is here: a, m, y
Explanation: Here, the unique alphabets in the list are 'a', 'y', and 'm', hence their sorted order is 'a, m, y'.

Now, solve this: ['271', '1361', 'o', '8801', 't', 'b', 'n', 'w', 'n', 'j', 'f', '451', '5761', '2973', 'h', 't', 'w', '9985', '6015', 'i', '2933', '1311', 's', 'j', '6185', 'h', 'r', '2723', '7591', 'j', '6655', '4643', '6595', '7673', 'h', '8617', '629', '5107', 'q', '3653', 't', '3547', '2255', 'i']
Solution:
b, f, h, i, j, n, o, q, r, s, t, w