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

Example Input: [5639, 'n', 'J', '9525', 'B', 'o', 's', 'P'], ['t', 893, 4667, '9525', 'B', 'o', 7501, 'z', 6255]
Example Output: 9525, B, o

Example Input: ['N', 'z', 9641, 'z', 'f', 'o', 'L', 'D', 'w', 2793, 'b'], ['Q', 'R', 'z', 'f', 'o', 'L', 'A', 4343, 8711]
Example Output: z, f, o, L

Example Input: ['C', 1421, '2827', 'w', 'n', '317', '7315', '3589', 'd', 3803, 'x', 373, 7345, 'O'], [9839, 5935, '2827', 'w', 'n', '317', '7315', '3589', 'Z', 'C', 4111]
Example Output:
2827, w, n, 317, 7315, 3589