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.

Input: Consider Input: FLYYRxXtDEyJSLLYb, TWXXtDEyJYKUhaU

Output: b, d, e, f, j, l, r, s, t, x, y


Input: Consider Input: PKCNpqWrCsXvrjDhiNBDxhenhlPZnS, KZUrjDhiNBDxhenhAgAClecHAIN

Output: b, c, d, e, h, i, j, k, l, n, p, q, r, s, v, w, x, z


Input: Consider Input: TGAXFZusDAZrEfgOIEUFirELMX, mUQZrEfgOIEUFiPeCSBAq


Output: a, d, e, f, g, i, l, m, o, r, s, t, u, x, z