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

Example Input: [7849, 813, 1309, 3749, '10001', 'g', '1057', 'c', 't', 't', 'i', 2269, 'M', 'q', 373], ['d', 4077, 3209, 'g', 5643, '10001', 'g', '1057', 'c', 't', 't', 'h', 'Y', 8349, 'q', 3939, 1333]
Example Output: 10001, g, 1057, c, t, t

Example Input: ['g', 6485, 9363, 'd', 'C', '7381', 'E', '3625', '8935', '4975', '4199', 'w', '4225', '9911', '4731', 'V', 'K', 2283, 7681, 'G', 1655, 'Y', 5095, 'b', 'x', 'V'], ['N', 'b', 'd', 't', 6171, 3157, 'y', 7821, 8523, 9675, 'd', 'C', '7381', 'E', '3625', '8935', '4975', '4199', 'w', '4225', '9911', '4731', 'G', 6357, 2383, 'j', 'N', 383]
Example Output: d, C, 7381, E, 3625, 8935, 4975, 4199, w, 4225, 9911, 4731

Example Input: [8373, 'o', '1105', '2397', 'm', 195], ['K', 'q', '1105', '2397', 'S', 6737]
Example Output:
1105, 2397