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: [8893, 7651, 'T', 'g', '6703', 'M', 'F', 'Q', 'm', '2731', 'Y', '5819', '3933', 'E', 'C', 'u', 'a', 'x', 1605, 'L', 'b'], [7397, 4199, 'g', '6703', 'M', 'F', 'Q', 'm', '2731', 'Y', '5819', '3933', 'E', 'C', 'u', 'S', 'c', 'Y', 'Z', 'S', 1235, 'v', 'I', 's']
Output:
g, 6703, M, F, Q, m, 2731, Y, 5819, 3933, E, C, u