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:
trdDvNFBAXegLkliLMByJ, TsvYXegLkliLMaGgPs

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


Ex Input:
DeYbPLFjoovQgoMwxnATTb, UvvmCOKdYwyjoovQgoMwxnLBbUxq

Ex Output:
b, c, d, g, j, k, l, m, n, o, q, u, v, w, x, y


Ex Input:
ACRcfQWvRtuAsFyCAQz, QeRtuAsFyCABj

Ex Output:

a, c, f, q, r, s, t, u, v, w, y, z