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: [3071, 2653, 'M', 6333, 'D', 4371, 4249, 'E', 'r', 7073, 'O', 1635, 8531, 4715, 5381, 1361, 737, 'j', 4947, 7125, 1963, 'R', 2241, 'Z', 8155, 'n', '1541', 'T', '8261', '7815', 'r', '2001', '7951', '4851', 'R', '9231', 'K', 'J', '9347', '2365', '8287', '2771', '8525', '3737', 'M', 'l', '8845', 'z', 'e', 'P', 'N', '4953', 'H', 'Z', 'f', 851, 'X', 'f', 'W', 4547, 'L', 'M', 'C', 'a', 'x', 8451, 'V', 7487, 725, 's', 'Z', 'p', 'C', 675], ['L', 's', 6203, 7647, 8423, 157, 7325, 3581, 5703, 9917, 's', 'R', 'x', 'a', 'e', 'k', 'n', 'H', 9133, 'r', 'l', 8405, 1017, 'n', 3697, '1541', 'T', '8261', '7815', 'r', '2001', '7951', '4851', 'R', '9231', 'K', 'J', '9347', '2365', '8287', '2771', '8525', '3737', 'M', 'l', '8845', 'z', 'e', 'P', 'N', '4953', 'q', 'z']
Solution:
1541, T, 8261, 7815, r, 2001, 7951, 4851, R, 9231, K, J, 9347, 2365, 8287, 2771, 8525, 3737, M, l, 8845, z, e, P, N, 4953