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.

[4649, 1863, 'w', 'Q', '8901', '7393', 'L', 's', 'g', 7521], ['j', 'b', 'E', 6575, 'Q', '8901', '7393', 'L', 'b', 'E', 9691, 'Y']
Output:
Q, 8901, 7393, L