Instructions: In this task, you are given two lists A,B. Find the longest common subsequence in the lists A and B.
Input: ['o', 'a', 'P', 6871, 'D', '5081', '4561', 'j', '999', '1841', 'd', 'F', '1883', '7365', 'a', '3763', 'H', '5913', '2341', '5115', '3101', 'H', 'E', 'G', 'r', 'X', '1337', '887', 'p', '2891', '4005', '987', 'h', '7763', 'y', 5731, 9753, 'p', 1689, 4165, 2743, 'V', 8075, 4075, 5745, 8531, 9683, 1309, 7555, 7453, 1347, 'W', 'h', 'v', 'p', 2693, 'b', 'y'], [6145, 'w', 'e', 'I', 2413, 'D', '5081', '4561', 'j', '999', '1841', 'd', 'F', '1883', '7365', 'a', '3763', 'H', '5913', '2341', '5115', '3101', 'H', 'E', 'G', 'r', 'X', '1337', '887', 'p', '2891', '4005', '987', 'h', '7763', 'O', 5991, 'Y', 619, 'G', 9413]
Output:
D, 5081, 4561, j, 999, 1841, d, F, 1883, 7365, a, 3763, H, 5913, 2341, 5115, 3101, H, E, G, r, X, 1337, 887, p, 2891, 4005, 987, h, 7763