Definition: In this task, you are given two lists A,B. Find the longest common subsequence in the lists A and B.
Input: ['y', 5907, 8165, 'r', 'k', 'i', 9897, 'f', 'R', 'a', 1487, 4783, 4111, 9193, 2097, 1071, 'L', 6491, 4201, 'v', 'd', '9793', 'b', 'c', 'h', '7927', 'w', 'y', 'P', 'H', '9039', 'X', 'M', 'g', '9517', 'H', 'C', '4353', 'j', '5941', 'R', 9535, 'g', 'H', 4671, 4625, 2519, 'G', 'D', 3467, 9695, 'U', 3471, 811, 'z', 'C', 5667, 287, 1615], ['C', 'L', 2567, 'B', 7237, 'U', 1027, 'R', 8563, 2857, 'E', 7075, 9449, 4955, 4859, 'M', 'v', 'd', '9793', 'b', 'c', 'h', '7927', 'w', 'y', 'P', 'H', '9039', 'X', 'M', 'g', '9517', 'H', 'C', '4353', 'j', '5941', 'h', 2851, 'b', 'i', 'U', 'J', 3505, 'H', 3287, 'v', 327, 8745]
Output:
v, d, 9793, b, c, h, 7927, w, y, P, H, 9039, X, M, g, 9517, H, C, 4353, j, 5941