Given the task definition, example input & output, solve the new input case.
In this task, you are given two lists A,B. Find the longest common subsequence in the lists A and B.
Example: [5797, 8817, '8297', 'b', 'U', 'b'], [5843, 8809, '8297', 'b', 'W', 'C']
Output: 8297, b
Here, '8297, b' is the longest common subsequence in both the input lists [5797, 8817, '8297', 'b', 'U', 'b'] and [5843, 8809, '8297', 'b', 'W', 'C'].

New input case for you: ['C', 1421, '2827', 'w', 'n', '317', '7315', '3589', 'd', 3803, 'x', 373, 7345, 'O'], [9839, 5935, '2827', 'w', 'n', '317', '7315', '3589', 'Z', 'C', 4111]
Output:
2827, w, n, 317, 7315, 3589