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:
ehhTtSMCRSsmdFHOSjcfOQKQSXJnFgypNT, fcmdFHOSjcfOQKQCsxIeofFPf

Ex Output:
c, d, e, f, g, h, j, k, m, n, o, p, q, r, s, t, x, y


Ex Input:
dITBrEWYiRvYDSdFHymC, AvEWYiRvYDSdFvAN

Ex Output:
b, c, d, e, f, h, i, m, r, s, t, v, w, y


Ex Input:
sQkOkCJnaTNHScTLb, EctkErmaCJnaTNHScmyMfiHLH

Ex Output:

a, c, e, f, h, i, j, k, l, m, n, r, s, t, y