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: ['S', 1843, 2639, 'R', 'x', 'D', 3901, 2877, 8813, 4451, 'z', '7845', 'O', 'x', 'S', '4229', 'd', 'Q', '1809', '8595', 'O', '5057', '1715', 'Z', '4899', '1401', 'V', 'r', 'L', 'D', 5199, 'D'], ['X', 'e', 'S', 'h', 'a', 6049, 'm', 'f', 5227, 'z', '7845', 'O', 'x', 'S', '4229', 'd', 'Q', '1809', '8595', 'O', '5057', '1715', 'Z', '4899', '1401', 'L', 2691, 825, 2191, 1321, 8477, 7509, 'L', 'V', 'x', 5579, 5927, 7391, 'O', 'Q']
Output:
z, 7845, O, x, S, 4229, d, Q, 1809, 8595, O, 5057, 1715, Z, 4899, 1401