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

Ex Input:
[7045, 'e', 3545, 6563, '5913', 'X', '5591', 'o', 'T', 'b'], [145, 'm', 'I', 'F', '5913', 'X', '5591', 'o', 'F', 6499, 3777]

Ex Output:
5913, X, 5591, o


Ex Input:
[5639, 'n', 'J', '9525', 'B', 'o', 's', 'P'], ['t', 893, 4667, '9525', 'B', 'o', 7501, 'z', 6255]

Ex Output:
9525, B, o


Ex Input:
['Z', 5559, '353', 'o', 'L', 'O', '9505', 'O', 't', 'H', 'c', 't', 9765, 'W', 1717, 491], ['V', 2019, '353', 'o', 'L', 'O', '9505', 'O', 't', 'g', 'O', 'b', 'a']

Ex Output:

353, o, L, O, 9505, O, t