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 Input:
rwXLbRVJPNyDULWdB, KwYZpVJPNyDULyJ

Ex Output:
b, d, j, l, n, p, r, u, v, w, x, y


Ex Input:
gGpwTQljIviOhUPsiPIut, bWCYfROIJnpCwTQljIviOhUPsWWhs

Ex Output:
b, c, f, h, i, j, l, n, o, p, q, r, s, t, u, v, w, y


Ex Input:
XzsWfqufzZtSZVEzWkXgRkNfkpeOyUxvbRQBI, NIZVEzWkXgRkNfkFPIJkGo

Ex Output:

b, e, f, g, i, k, n, o, p, q, r, s, t, u, v, w, x, y, z