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: TkSNYUPOoSdnCjGxL, UEjqkdePOoSdnCjTmWCW

Output: c, d, e, j, k, m, n, o, p, q, s, t, u, w


Input: Consider Input: vyJFemSiATOCJPhSnBJGg, dFgDGxiATOCJPdttF

Output: a, b, c, e, f, g, h, i, j, m, n, o, p, s, t, v, y


Input: Consider Input: ELLpZLlFFxnptFybjuqJytNzNXvgHBM, nWyfnptFybjuqJytNzjdGyBKCcvJLd


Output: b, e, f, g, h, j, l, m, n, p, q, t, u, v, x, y, z