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.

Example Input: gSuLJwUyaAkYayjADtEcNRldT, nCXjYywUyaAkYayjADtEcugBUrMsBijMlpiK
Example Output: a, b, c, d, e, g, i, j, k, l, m, n, p, r, s, t, u, w, x, y

Example Input: jsxnWFnjZfpxNyNuKfkMPrlFsxVoQT, lhDCbjIyJnfpNyNuKfkMPrlFBigFohNHa
Example Output: a, b, c, d, f, g, h, i, j, k, l, m, n, o, p, r, u, y

Example Input: ZCiROfh, uUiRwy
Example Output:
c, f, h, i, o, r, z