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: yKjDNYQJoDO, MPNYQJxK

Output: d, j, k, n, o, q, y


Input: Consider Input: jOEeEANtxPSP, wvbQEANtmkb

Output: a, e, j, n, o, p, s, t, x


Input: Consider Input: VKkcMCnMHKbKZOc, eYewCnMHKWRguB


Output: b, c, h, k, m, n, o, v, z