Given the task definition, example input & output, solve the new input case.
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.
Example: JkbloNUq, nYblowj
Output: b, j, k, l, n, o, q, u
Here, 'JkbloNUq' is the longer string among the two input strings. Lowercasing it and finding all unique alphabets gives 'b, j, k, l, n, o, q, u'.

New input case for you: SHTMlXMkDPJW, XalGsTMlXMkDPlcJs
Output:
a, c, d, g, j, k, l, m, p, s, t, x