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: NoxxfpFfMtuWEzLRtph, ehfpFfMtuWEzLRtzYlaGRAkftTbk

Output: a, b, e, f, g, h, k, l, m, p, r, t, u, w, y, z


Input: Consider Input: BMxJjtdrqrLsxsGSDQM, qlIrrqrLsxsgPFtOQJ

Output: b, d, g, j, l, m, q, r, s, t, x


Input: Consider Input: trdDvNFBAXegLkliLMByJ, TsvYXegLkliLMaGgPs


Output: a, b, d, e, f, g, i, j, k, l, m, n, r, t, v, x, y