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: [9181, 'y', 'U', 4117, 'I', 2215, 'T', 1497, 'b', '689', '5065', '8401', 'D', '6949', '2197', 'r', '9933', '3513', 'U', 6357], [5939, 2135, 4351, 'a', 6299, 1417, 3609, 8181, '689', '5065', '8401', 'D', '6949', '2197', 'r', '9933', '3513', 'b', 2819, 8577, 'Z', 'R', 'G', 7917, 'W']
Output:
689, 5065, 8401, D, 6949, 2197, r, 9933, 3513