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

Ex Input:
[7675, 6429, 'Y', 'J', '6533', 'o', '47', '6333', 'W', 'J'], [6609, 2621, '6533', 'o', '47', '6333', 'm', 'k', 2605, 'd']

Ex Output:
6533, o, 47, 6333


Ex Input:
[2449, 'h', 'F', 2217, 'G', 2655, 'k', 'Y', '8427', '2933', 'x', '2689', '9305', 'L', '9263', '2671', 'q', 9553, 4023, 127], [849, 7901, 'd', '8427', '2933', 'x', '2689', '9305', 'L', '9263', '2671', 'r', 'A', 'F']

Ex Output:
8427, 2933, x, 2689, 9305, L, 9263, 2671


Ex Input:
['S', 737, 'D', '6509', '2533', 'B', 2583], ['S', 5373, 'D', '6509', '2533', 'c', 879]

Ex Output:

D, 6509, 2533