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: ['h', 'j', 6725, 'P', 'o', 'e', '9965', '2669', 'k', 'g', 't', '5599', '601', 'A', 5985, 3997, 5131, 889, 'W', 'k', 1793], [867, 'E', 'j', 1379, 'a', 2729, 'v', 8351, 'P', 'o', 'e', '9965', '2669', 'k', 'g', 't', '5599', '601', 'w', 8133, 'a', 'O']
Output:
P, o, e, 9965, 2669, k, g, t, 5599, 601