You will be given a definition of a task first, then an example. Follow the example to solve a new instance of the task.
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.

JkbloNUq, nYblowj
Solution: b, j, k, l, n, o, q, u
Why? 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: VPfradiOvyd, PgIradidGR
Solution:
a, d, f, i, o, p, r, v, y