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: [6077, 1965, 8067, 1587, 529, 6801, 3445, 7875, 'K', 1843, 5237, 'b', 'T', '5291', 'm', 'c', '3705', 'e', '9575', 'R', '3987', '7293', '3139', '3663', '5983', 'W', 'B', '5849', 'N', 'q', '665', 'K', '665', '4303', '5763', 'K', 'k', 'w', 'p', 17, 'E', 'h', 9059, 1239, 2507, 1063, 2313, 1999, 4269, 'm', 7539, 'T', 'n'], [9051, 4265, 8895, 'w', 5605, 4307, 5171, 1937, 'c', 5669, 5293, 7877, 'A', '5291', 'm', 'c', '3705', 'e', '9575', 'R', '3987', '7293', '3139', '3663', '5983', 'W', 'B', '5849', 'N', 'q', '665', 'K', '665', '4303', '5763', 'K', 'k', 'w', 'x', 'Y', 'o', 'n', 8303, 4123, 9855, 629, 6499, 'c', 'a', 'l']
Output:
5291, m, c, 3705, e, 9575, R, 3987, 7293, 3139, 3663, 5983, W, B, 5849, N, q, 665, K, 665, 4303, 5763, K, k, w