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:
HQatwPItnYZbNOK, dHPItnYjOt

Ex Output:
a, b, h, i, k, n, o, p, q, t, w, y, z


Ex Input:
OdNvPdtthDbbn, sujUTvPdtthDuOKXu

Ex Output:
d, h, j, k, o, p, s, t, u, v, x


Ex Input:
LMpkFlLZErbeIKMybWXOnuWKDNygkL, fSqGLZErbeIKMybWXrbakDGrQ

Ex Output:

b, d, e, f, g, i, k, l, m, n, o, p, r, u, w, x, y, z