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

Ex Input:
['o', 'f', '955', 'y', 'O', 2181], ['M', 'l', '955', 'y', 'h', 5209]

Ex Output:
955, y


Ex Input:
['m', 'K', 2769, 'i', 'k', 853, 'P', '9255', 'N', '8281', 'f', 'm', 'V', 'a', 3525, 7823, 2111, 'T'], ['Q', 1337, 'I', 'P', '9255', 'N', '8281', 'f', 'm', 'g', 'M', 3873]

Ex Output:
P, 9255, N, 8281, f, m


Ex Input:
[9953, 4209, 803, 'P', 'u', 43, 359, 3133, 'U', 'y', '9575', 'j', 'R', 'H', 'v', 'G', 'N', 'c', 'n', 701, 9287], [4275, 7061, 'z', 'y', '9575', 'j', 'R', 'H', 'v', 'G', 'N', 'c', 'X', 4159, 211, 9291, 'B']

Ex Output:

y, 9575, j, R, H, v, G, N, c


