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: ['W', 8439, 3027, 'H', '8815', '4315', 'S', '9997', 's', 'n', 'q', '9847', '5429', 'y', 'G', 't', 'Y', 'm'], ['n', 9185, 'Z', 3041, 'H', '8815', '4315', 'S', '9997', 's', 'n', 'q', '9847', '5429', 'y', 'G', 't', 'F', 5929, 'm', 4783, 'N', 929, 8451, 't', 85, 'G', 5927]
Output:
H, 8815, 4315, S, 9997, s, n, q, 9847, 5429, y, G, t