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.

[2647, 'D', 'q', 'P', 6067, 3591, 1081, 'T', 2835, 5797, 7213, 7679, 'W', 4661, 7889, 9677, 3313, 7233, 9121, 2061, 'v', 'u', '325', '8069', '4691', '9597', 'O', '8811', '6583', 'M', '4393', '1767', 'v', '2707', '4419', 'Q', 'a', '3885', '1795', '9599', 'a', 547, 657, 5609], ['o', 8055, 'b', 345, 'k', 1237, 'R', 'M', 2177, 'V', 3921, 'k', 'o', 'z', 7451, 27, 'F', 8073, 'v', 'u', '325', '8069', '4691', '9597', 'O', '8811', '6583', 'M', '4393', '1767', 'v', '2707', '4419', 'Q', 'a', '3885', '1795', '9599', 'e', 9767, 1391, 'Q']
Output:
v, u, 325, 8069, 4691, 9597, O, 8811, 6583, M, 4393, 1767, v, 2707, 4419, Q, a, 3885, 1795, 9599