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.

Ex Input:
dHzxksIebgOAsxYGAbumMFYvfUZpxhQBXKgQh, fYMyWqEGAsxYGAbumMFYvfHXWqQ

Ex Output:
a, b, d, e, f, g, h, i, k, m, o, p, q, s, u, v, x, y, z


Ex Input:
gZDBMzHd, PCDBMhl

Ex Output:
b, d, g, h, m, z


Ex Input:
HgfvpittmOrtVvh, AQoovNpittmOrtVJcXbjss

Ex Output:

a, b, c, i, j, m, n, o, p, q, r, s, t, v, x