In this task, you are given two lists A,B. Find the longest common subsequence in the lists A and B.

Ex Input:
[4249, 1307, 'R', '3377', '9383', 'w', '7897', 'S', '1791', 'f', '6787', 'H', 'K', 7197, 3907, 'I', 5561], [8961, 1477, 'X', 'C', 7153, 1005, 'C', '3377', '9383', 'w', '7897', 'S', '1791', 'f', '6787', 'L', 7313, 2449, 4181, 1573]

Ex Output:
3377, 9383, w, 7897, S, 1791, f, 6787


Ex Input:
['w', 3897, 'U', 'a', '455', '6499', '8975', '9003', 'O', 'j', 'T', 'P', 'C', 'z', 5141, 1751, 6731, 'r'], ['B', 8071, 703, 'G', 885, 'Z', 2391, 1749, 4177, 'U', 'a', '455', '6499', '8975', '9003', 'O', 'j', 'T', 'D', 8751, 'y', 2941]

Ex Output:
U, a, 455, 6499, 8975, 9003, O, j, T


Ex Input:
['Z', 'C', '7501', 'J', 'M', 'Y', 'N', 4137], ['t', 'P', '7501', 'J', 'M', 'y', 'F', 7475]

Ex Output:

7501, J, M