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: ['e', 'd', 8659, 6023, 'V', 'H', 'd', 'U', 9359, 'V', 'u', 'v', 2401, 'a', 'P', 'X', 1099, 4105, 'o', '2201', 'm', '8533', 'M', 'e', '2967', '1053', '8157', '6395', '8225', '6543', 'Q', '9957', '5823', '2071', 'F', '8903', '5367', 'X', 'd', '2691', '4605', 'b', 9575, 'j', 'A', 'e', 8081, 5561, 4661, 'X', 'X', 3461, 't', 6159, 'C', 8961, 'q', 'J', 2857, 5867, 'x', 9935, 'R'], ['F', 5595, 5707, 'T', 529, 'H', 8983, 5177, 'r', 'c', 'o', '2201', 'm', '8533', 'M', 'e', '2967', '1053', '8157', '6395', '8225', '6543', 'Q', '9957', '5823', '2071', 'F', '8903', '5367', 'X', 'd', '2691', '4605', 'U', 9791, 1707, 8237, 9409, 'b', 'u', 5969, 9873, 165, 't', 't']
Output:
o, 2201, m, 8533, M, e, 2967, 1053, 8157, 6395, 8225, 6543, Q, 9957, 5823, 2071, F, 8903, 5367, X, d, 2691, 4605