Definition: In this task, you are given two lists A,B. Find the longest common subsequence in the lists A and B.
Input: [403, 'x', '7513', '9667', '5285', 'r', 'g', 'V', '6007', 'x', 'J', 'z', 'x', 'C', 'f', 'n', 'o', '2341', 'S', 'y', 'U'], [6059, 151, 'W', 649, 9007, 8163, 'K', 'U', 'b', 309, 3993, 3515, 9035, 'C', 4781, '7513', '9667', '5285', 'r', 'g', 'V', '6007', 'x', 'J', 'z', 'x', 'C', 'f', 'n', 'o', '2341', 'h', 8311, 9083, 6343, 'E', 'v', 7751, 'H', 'E', 'g', 879, 'w', 6629, 6937, 7189]
Output:
7513, 9667, 5285, r, g, V, 6007, x, J, z, x, C, f, n, o, 2341