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:
bPbWZfYaALGgTEvvK, fRXIqSuYTfYaALGgTEosEiMN

Ex Output:
a, e, f, g, i, l, m, n, o, q, r, s, t, u, x, y


Ex Input:
zglVHUXtAsJJnlGnb, TVlXtAsJJBMA

Ex Output:
a, b, g, h, j, l, n, s, t, u, v, x, z


Ex Input:
tSMnPooIQIABcCnlKZaepbVU, eaUSZPSISAPooIQIABcCnlKhpC

Ex Output:

a, b, c, e, h, i, k, l, n, o, p, q, s, u, z