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: jQrUghdklcUCJpVIiWzmPds, ugcCLedWSrUghdklcUCJcrqTG
Example Output: c, d, e, g, h, j, k, l, q, r, s, t, u, w

Example Input: DTAWLIdITaWlAkuGndOAZKBCX, ZUIbfylXAdITaWlAkuGndOmCVv
Example Output: a, b, c, d, f, g, i, k, l, m, n, o, t, u, v, w, x, y, z

Example Input: ggFChPLIhqAtQnXxfRfjnsq, OmtmjfMpSzqAtQnXxfRfEAnDv
Example Output:
a, d, e, f, j, m, n, o, p, q, r, s, t, v, x, z