Given the task definition, example input & output, solve the new input case.
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.
Example: ['8129', 'a', '4245', 'y', 'm', 'a']
Output: a, m, y
Here, the unique alphabets in the list are 'a', 'y', and 'm', hence their sorted order is 'a, m, y'.

New input case for you: ['461', 'd', '8697', 't', '6025', 'u', 's', 'j', '1627', '2299', 'r', '2507', '8213', '1975', '45', '9079', '531', 'd', 'r', 'd', 'z', 'a', '9147', 'j', '1375', '3325', '6269', 'f', 'e', 'c', '463', 'd', '8845', '1597', '3309']
Output:
a, c, d, e, f, j, r, s, t, u, z