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:
YhnGGalOktkHGmmvmUblDoJOtoSoXV, xTcuoUGpHGmmvmUblDoJOtspwBziLZY

Ex Output:
b, c, d, g, h, i, j, l, m, o, p, s, t, u, v, w, x, y, z


Ex Input:
KZHSbDTSBz, xRdROmHSbDTSKKYL

Ex Output:
b, d, h, k, l, m, o, r, s, t, x, y


Ex Input:
DfhYPlkgDuhPuqRDOSptNaznPtdeOgXmAPHCvIL, OUhRauqRDOSptNaznPtvOgVZyNtP

Ex Output:

a, c, d, e, f, g, h, i, k, l, m, n, o, p, q, r, s, t, u, v, x, y, z