In this task, you are given two strings A,B. Find the longer of the two lists, convert it to lowercase, and return all the unique alphabets used in it. The two input strings are never equal.

Let me give you an example: JkbloNUq, nYblowj
The answer to this example can be: b, j, k, l, n, o, q, u
Here is why: Here, 'JkbloNUq' is the longer string among the two input strings. Lowercasing it and finding all unique alphabets gives 'b, j, k, l, n, o, q, u'.

OK. solve this:
bVMNQidrHGrvuVhGFlZdg, sTGnBlyidrHGrvupeaFsqkt
Answer:
a, b, d, e, f, g, h, i, k, l, n, p, q, r, s, t, u, v, y