You will be given a definition of a task first, then some input of the task.
In this task, you are given two lists A,B. Find the longest common subsequence in the lists A and B.

[8545, 8013, 5519, 'g', 'M', '7689', '8391', '8227', 'E', 155, 'e', 'x', 'y'], ['u', 3257, 'U', 'X', 4535, 'g', 'M', '7689', '8391', '8227', 'F', 899, 'P']
Output:
g, M, 7689, 8391, 8227