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:
tIQTQpSpioQrGIrDPs, QXyjJrSqBSpioQrGIraRPw

Ex Output:
a, b, g, i, j, o, p, q, r, s, w, x, y


Ex Input:
hFDsTrkxLZUPIeerELi, FiHTGaYGTqvVTosTrkxLZUPIeerEeFwqqLsGyXYH

Ex Output:
a, e, f, g, h, i, k, l, o, p, q, r, s, t, u, v, w, x, y, z


Ex Input:
pvJfWkioqnEYQALIGUFSDCRksdPnYnuDy, ICabYQALIGUFSDCRktVPiCm

Ex Output:

a, c, d, e, f, g, i, j, k, l, n, o, p, q, r, s, u, v, w, y