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

Ex Input:
['u', 'r', 849, 'R', 'F', 'T', '8517', 'n', 'W', '7945', '6371', 'l', 'S', 'G', '7431', 'x', 'b', 'B', '437', '9051', 'p', '465', 'u', 'R', 'p', 'p', 'T', 'z', 'q', 'I', 435, 'f', 5345, 7911, 'A', 4969, 'Z', 'z', 'g', 'F', 'j', 'p', 8691, 'W', 'g'], ['O', 'A', 'Y', 7777, 1037, 637, 'X', 3059, 1375, 1443, 1615, 9593, 'D', 'R', 'S', 'M', 5927, 'R', 'F', 'T', '8517', 'n', 'W', '7945', '6371', 'l', 'S', 'G', '7431', 'x', 'b', 'B', '437', '9051', 'p', '465', 'u', 'R', 'p', 'Q', 'Y', 1371, 'M', 'Q', 1545, 4395, 'm', 'R', 6291, 'g', 'X', 5919, 'p', 'V', 'Y', 'N', 1117, 'U']

Ex Output:
R, F, T, 8517, n, W, 7945, 6371, l, S, G, 7431, x, b, B, 437, 9051, p, 465, u, R, p


Ex Input:
[5587, 5085, 'i', 'H', 9133, 'D', 'y', 'M', 't', 'r', '7787', '1083', 'F', '8153', 'i', '979', 'b', 'z', 'g', '1657', 't', '2281', '8149', '7429', 'o', 'I', 573, 1699, 'M', 'm', 'r', 'o', 2659, 8785], ['T', 'h', 9991, 'c', 'J', 'Z', 'Z', 1541, 7687, 'z', 1961, 'A', 9619, 'b', 'o', 'r', '7787', '1083', 'F', '8153', 'i', '979', 'b', 'z', 'g', '1657', 't', '2281', '8149', '7429', 'o', 'p', 6099, 'W', 'V', 'Z', 4553, 5651]

Ex Output:
r, 7787, 1083, F, 8153, i, 979, b, z, g, 1657, t, 2281, 8149, 7429, o


Ex Input:
['G', 'T', '495', 'H', '9945', 'c', '8171', 'j', 541, 'V', 'e', 3243], [4293, 9967, 'Z', 665, 'J', '495', 'H', '9945', 'c', '8171', 'M', 325, 723]

Ex Output:

495, H, 9945, c, 8171