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: bjdguqcbNhYueKC, lAxsXlguqcbNhduSlM

Output: a, b, c, d, g, h, l, m, n, q, s, u, x


Input: Consider Input: hHYNOpAavuIXjSOKCyKecvADmdoCavTlYFTUi, hlHSOKCyKecvADmdUNpJS

Output: a, c, d, e, f, h, i, j, k, l, m, n, o, p, s, t, u, v, x, y


Input: Consider Input: WivTmJCo, OXvTmJpbhY


Output: b, h, j, m, o, p, t, v, x, y