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 Input: BMxJjtdrqrLsxsGSDQM, qlIrrqrLsxsgPFtOQJ
Example Output: b, d, g, j, l, m, q, r, s, t, x

Example Input: lNlYdMMNbnRCGtqFuiZF, DBNbnRCGtqhfniWHe
Example Output: b, c, d, f, g, i, l, m, n, q, r, t, u, y, z

Example Input: NQYOynXOXuKBfFbvgeeWYqY, jfYwjVpqkYhSnXOXuKBfFbvgsSQNcRIymt
Example Output:
b, c, f, g, h, i, j, k, m, n, o, p, q, r, s, t, u, v, w, x, y