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

Problem: ['2233', '3241', 'e', '453', '3163', '9369', 'j', 'f', 'c', '1295', 'e', 'j', 'j', '3855', 'h', 'l', 'p', '8299', '5853', '6189', 'r', '3691', 'y', 'k', 'a', 'c', '6235', 'r', '759', '2051', 'h', '8449', 'p', 'h', 'w', 'a', '8167', 'i', '5317', '3509', 't', '3483']
Solution:
a, c, e, f, h, i, j, k, l, p, r, t, w, y