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

Ex Input:
['c', 'G', 8225, 6329, '6291', '5279', 'n', 'A', 'J', 'n', 5221, 'r', 't'], ['k', 'M', 'Z', 'B', 4003, '6291', '5279', 'n', 'A', 'J', 'g', 'm']

Ex Output:
6291, 5279, n, A, J


Ex Input:
['m', 'J', 'X', '8931', 'u', 'm'], ['V', 3299, 'X', '8931', 'Z', 6965]

Ex Output:
X, 8931


Ex Input:
[1947, 'X', 'h', 4677, 2577, 'v', 7603, 's', 5951, 6723, 'P', '7169', 'U', '2475', '5387', '5153', '6661', '8035', 'v', 'G', 'v', 'I', 'H', 'I'], ['D', 'd', 'h', 'D', 1633, 'h', 'w', 679, 'J', 6281, '7169', 'U', '2475', '5387', '5153', '6661', '8035', 'v', 'G', 'v', 'I', 'P', 'G', 'S', 'E']

Ex Output:

7169, U, 2475, 5387, 5153, 6661, 8035, v, G, v, I