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: ['A', 'x', 8839, 'X', 5037, 'o', 'c', '2293', '5289', 'w', 'i', '9455', '559', 'X', '531', 'H', 'I', 'B', 'c', '6499', 'i', '1241', '1511', '9197', 'K', '7459', 'l', '1001', 'x', 'g', '1887', 'n', 'o', 'B', 'n', 'P', 'M', 5381, 'd', 5445, 3285, 1333, 'K', 'j', 2269, 't', 'u', 'P', 1967, 379, 'v', 7053, 8757, 3771, 'O'], [6427, 'D', 'F', 'U', 's', 867, 9297, 'o', 4413, 8943, 'p', 4659, 'p', 'g', 'Z', 7391, 4011, 'E', 6307, 'x', 7313, 4071, 443, 'q', 3041, 489, 6609, 'c', '2293', '5289', 'w', 'i', '9455', '559', 'X', '531', 'H', 'I', 'B', 'c', '6499', 'i', '1241', '1511', '9197', 'K', '7459', 'l', '1001', 'x', 'g', '1887', 'n', 'o', 'B', 'x', 'K', 5153, 171, 825, 'V', 605, 705, 'B', 45, 6307, 1081, 'T']
Output:
c, 2293, 5289, w, i, 9455, 559, X, 531, H, I, B, c, 6499, i, 1241, 1511, 9197, K, 7459, l, 1001, x, g, 1887, n, o, B