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', 'Q', 'G', 'H', 'v', '6247', 'n', 'W', '9609', '4901', 'M', 6973, 'C', 6827, 'l', 9169], [7211, 'F', 's', 1487, 'G', 'H', 'v', '6247', 'n', 'W', '9609', '4901', 't', 27, 'H', 2817, 6249, 'c', 545, 6093]
Output:
G, H, v, 6247, n, W, 9609, 4901