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.

['W', 4149, 6759, 'n', 'x', '6945', 'E', 'c', '8965', 'I', 'v', 'Q', '4227', 'k', 'Y', 'r', '9373', 'o', 8423], ['R', 'Z', 2501, '6945', 'E', 'c', '8965', 'I', 'v', 'Q', '4227', 'k', 'Y', 'r', '9373', 'q', 't', 4629, 8307, 787, 6469, 4585, 'F', 'c']
Output:
6945, E, c, 8965, I, v, Q, 4227, k, Y, r, 9373