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

Example Input: [675, 'N', '7605', 'W', 'J', 'E', '2099', 'I', 'i'], ['T', 8995, 'E', 'U', '7605', 'W', 'J', 'E', '2099', 'R', 3629, 977]
Example Output: 7605, W, J, E, 2099

Example Input: [5703, 'd', 2573, 'V', 9273, '7133', 'O', '6191', '6151', '5017', 'c', 'b', '1721', 'Z', 'J', 'C', 'O', 6077, 1125, 1345, 8989], ['f', 59, 8449, 5387, 8075, 9721, 5271, '7133', 'O', '6191', '6151', '5017', 'c', 'b', '1721', 2375, 3141, 'Z', 'Y', 'N']
Example Output: 7133, O, 6191, 6151, 5017, c, b, 1721

Example Input: [7857, 'I', '7569', 'd', '885', 'N', '8635', 'a', 'a', 't'], ['M', 6487, '7569', 'd', '885', 'N', '8635', 'W', 2199, 2205]
Example Output:
7569, d, 885, N, 8635