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: TXPLGyYghekFMEDqxuIhphYG, DkWgjghekFMEDqxGkcsKpQc

Output: d, e, f, g, h, i, k, l, m, p, q, t, u, x, y


Input: Consider Input: aZRlxbaWSHgGOHSQlR, lIoWRlxbaWSHgGOHSQmwGsMAWq

Output: a, b, g, h, i, l, m, o, q, r, s, w, x


Input: Consider Input: wBXUkzPNgUESulhmNmJyyFj, oQOgpkkhFjkzPNgUESulhmIp


Output: e, f, g, h, i, j, k, l, m, n, o, p, q, s, u, z