You will be given a definition of a task first, then an example. Follow the example to solve a new instance of the task.
In this task, you are given two lists A,B. Find the longest common subsequence in the lists A and B.

[5797, 8817, '8297', 'b', 'U', 'b'], [5843, 8809, '8297', 'b', 'W', 'C']
Solution: 8297, b
Why? 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: ['C', 4631, 'z', 6691, 4667, 'U', 4793, 'n', 1951, 5567, 'l', '5407', '2233', 'm', 'j', 'K', '7419', 'Q', 'j', '8907', '6331', '2267', '9839', 'K', 'n', 'n', 'X'], [531, 1535, 3393, 6011, 5267, 8301, 'R', 'B', 'l', 8019, '5407', '2233', 'm', 'j', 'K', '7419', 'Q', 'j', '8907', '6331', '2267', '9839', 'K', 'R', 5659, 'U', 'E', 'I', 8877, 2419]
Solution:
5407, 2233, m, j, K, 7419, Q, j, 8907, 6331, 2267, 9839, K