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.

Input: Consider Input: GVhGZCAbIKpWruYLzrCsVsrOqofL, CBfrJRsTIKpWruYLzrCsVsUwTOMLqR

Output: b, c, f, i, j, k, l, m, o, p, q, r, s, t, u, v, w, y, z


Input: Consider Input: WZCsOnjQL, AssOnJeZ

Output: c, j, l, n, o, q, s, w, z


Input: Consider Input: tUeJeSMNmaxxXFpmKkbkW, xiWKmaxxXFpmHvJ


Output: a, b, e, f, j, k, m, n, p, s, t, u, w, x