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

Example Input: [7485, 'Y', 'T', '5979', 'w', 'Q', 'e'], [1525, 4389, 'm', 'T', '5979', 'w', 'w', 1497, 8995]
Example Output: T, 5979, w

Example Input: [1875, 'T', 'Y', '5527', 'F', 'y', '5669', 'm', 'k', 2655, 8089], [3997, 7707, 9937, 'M', '5527', 'F', 'y', '5669', 'm', 'a', 'e']
Example Output: 5527, F, y, 5669, m

Example Input: [241, 4975, 'J', 'f', 8909, 'M', 4069, '107', '1409', 'E', '8345', 'F', '9537', '8905', '849', 'W', 9299, 6831, 6935, 'q'], ['i', 5147, 't', 5355, 4475, 5833, 3863, 8725, '107', '1409', 'E', '8345', 'F', '9537', '8905', '849', 't', 'R', 1045, 'j']
Example Output:
107, 1409, E, 8345, F, 9537, 8905, 849