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: [6959, 349, 5581, 3847, 'O', 'H', 7037, 4263, 'N', 9753, 'A', 'd', 5827, 2837, 'j', 'r', '6365', '6391', '589', '7617', '8361', 'a', 'b', 'g', '1987', '8337', '4327', '1779', 'k', 'I', 'K', 'A', 'r', 'f', 'i', 'A', 6193, 8525, 2193, 'G', 6187, 3207, 8877], ['c', 3823, 5147, 'T', 4259, 2959, 4133, 267, 'N', 6081, 3157, 'r', '6365', '6391', '589', '7617', '8361', 'a', 'b', 'g', '1987', '8337', '4327', '1779', 'k', 'I', 'K', 'A', 'k', 'Z', 6779, 6795, 8125, 'm', 'h', 'm', 8333]
Solution:
r, 6365, 6391, 589, 7617, 8361, a, b, g, 1987, 8337, 4327, 1779, k, I, K, A