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

Example Input: [5599, 'o', 'p', 'T', 'o', 'p', 'B', 'M', '283', 'R', 'a', '9671', '8125', 'D', 'e', 'O', 'O', 3319], ['J', 2811, 7263, 'C', 4889, 477, 'o', 'p', 'B', 'M', '283', 'R', 'a', '9671', '8125', 'F', 3717, 'X', 1407, 2097, 'J', 'N', 'W']
Example Output: o, p, B, M, 283, R, a, 9671, 8125

Example Input: ['g', 305, '8447', 'K', 'y', 'D'], [2445, 5519, '8447', 'K', 't', 'l']
Example Output: 8447, K

Example 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']
Example Output:
y, 9575, j, R, H, v, G, N, c