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

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

Ex Output:
X, 8931


Ex Input:
[7217, 5633, 8727, 'l', 's', 'u', 'T', 'F', 'n', 'L', 'G', 'K', 'S', '523', '9835', '1331', '7069', '9089', 'z', '8111', 'C', '7653', 'P', 'J', 7151, 'J', 1523, 'p', 369, 8817, 'N', 'B', 1305, 1271, 1349, 3329, 1437, 'p'], [595, 7009, 'f', 463, 'B', 'V', 7397, 'n', 'L', 'G', 'K', 'S', '523', '9835', '1331', '7069', '9089', 'z', '8111', 'C', '7653', 'P', 'Y', 'x', 7741, 4563, 'O', 'l', 'D', 'U', 5221]

Ex Output:
n, L, G, K, S, 523, 9835, 1331, 7069, 9089, z, 8111, C, 7653, P


Ex Input:
[6341, 'i', 5555, 'k', '9721', 'x', 'q', 201], ['O', 7997, 'K', 'k', '9721', 'x', 'e', 8269]

Ex Output:

k, 9721, x