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.

[EX Q]: JJcoXFsrHURLWMeBNDsH, mSnhPfgHroXFsrHURLWrEf
[EX A]: e, f, g, h, l, m, n, o, p, r, s, u, w, x

[EX Q]: ksVeDQJKxYEXERggvgfjVibTswZG, nxTLiMZrgdtHeDQJKxYEXERggaT
[EX A]: b, d, e, f, g, i, j, k, q, r, s, t, v, w, x, y, z

[EX Q]: YMrORkkLeUuM, TZhDRkkLbK
[EX A]:
e, k, l, m, o, r, u, y