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: [59, 'X', 'Q', 145, 'I', 4881, 9651, 'h', 7737, 'I', 4015, 'y', 'W', 'f', '3837', 'O', '9891', '971', 'z', 'o', '8915', '1917', '903', '4753', 'I', 'X', '8609', '9597', '7485', 'g', 'Z', 'A', 'X', 'M', 'u', 'T', 2415, 'e', 9269, 'O', 6417, 4293, 'l', 10025, 's', 8025, 'I', 'y', 'S', 10005, 931, 403], [5255, 4737, 'C', 5821, 1291, 7333, 6685, 6029, 'Y', 8103, 'o', 'C', 59, 4189, 8023, 'x', 'O', 'W', 'f', '3837', 'O', '9891', '971', 'z', 'o', '8915', '1917', '903', '4753', 'I', 'X', '8609', '9597', '7485', 'g', 'Z', 'A', 'X', 'M', 'I', 5193, 'u', 'f']
Output:
W, f, 3837, O, 9891, 971, z, o, 8915, 1917, 903, 4753, I, X, 8609, 9597, 7485, g, Z, A, X, M