In this task, you are given two lists A,B. Find the longest common subsequence in the lists A and B.
One example: [5797, 8817, '8297', 'b', 'U', 'b'], [5843, 8809, '8297', 'b', 'W', 'C']
Solution is here: 8297, b
Explanation: 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'].

Now, solve this: [897, 4513, 'b', 4203, 'c', 'j', 3455, 'g', '863', '5907', '1095', 'l', '17', 'j', '7985', '9507', '5369', '9979', 'e', 'E', 'C', 8855, 'c', 3047, 6537, 9565], ['O', 2381, 'k', 'g', '863', '5907', '1095', 'l', '17', 'j', '7985', '9507', '5369', '9979', 'h', 'N', 9117, 9493, 'h', 4471, 7829, 9237, 8655]
Solution:
g, 863, 5907, 1095, l, 17, j, 7985, 9507, 5369, 9979