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

Example Input: [1307, 'u', 'Z', 3323, 191, 'i', 'h', 't', 'L', '8549', '7861', '9747', '3985', 'g', 'r', '1247', 'R', 'S', 'a', 'a', '749', 'C', 'M', 'y', 'h', 7985, 9989, 'j'], [2817, 1955, 2973, 'Y', 9221, 'z', '8549', '7861', '9747', '3985', 'g', 'r', '1247', 'R', 'S', 'a', 'a', '749', 'G', 'M', 2083, 'O']
Example Output: 8549, 7861, 9747, 3985, g, r, 1247, R, S, a, a, 749

Example Input: [3707, 6473, 'o', '495', '3897', 'O', 'x', '2409', '6843', '3477', '5411', 'G', 9269, 5835, 2723, 'm', 'n', 6209], [7513, 4579, 6017, 7723, '495', '3897', 'O', 'x', '2409', '6843', '3477', '5411', 'w', 'T', 'g', 'M', 'V']
Example Output: 495, 3897, O, x, 2409, 6843, 3477, 5411

Example Input: [9131, 'S', '8083', 'w', 'q', 3559], [4135, 'R', '8083', 'w', 'W', 'c']
Example Output:
8083, w