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: [7181, 7391, 7801, 1885, '6203', 'k', '4059', '7603', '4509', 'b', '7261', '9131', '7873', '9501', 'g', 'x', 4015, 'v', 'l', 6731, 'U', 5937], ['J', 3065, 4029, 3255, '6203', 'k', '4059', '7603', '4509', 'b', '7261', '9131', '7873', '9501', 'g', 's', 'u', 3563, 6549, 2183, 'G', 'Z', 4803]
Output:
6203, k, 4059, 7603, 4509, b, 7261, 9131, 7873, 9501, g