Instructions: In this task, you are given two lists A,B. Find the longest common subsequence in the lists A and B.
Input: [9117, 1907, 'H', 3211, 'Z', 4945, 9343, 'E', 'D', 'x', 77, 4485, 'C', 'w', 'x', 'd', 'i', 'U', '545', '6681', 'n', 'Q', '3085', '1997', '393', '9335', '8387', '8729', '821', '2379', 'i', 8253, 'h', 'E', 6305, 7001, 1663, 2465, 'Q', 'W', 2431, 'o', 'T', 3145, 'k'], [6737, 8753, 3405, 'M', 'v', 9407, 7749, 3777, 2915, 'a', 381, 'q', 'H', 'x', 'd', 'i', 'U', '545', '6681', 'n', 'Q', '3085', '1997', '393', '9335', '8387', '8729', '821', '2379', 'w', 3527, 4373, 1593, 7633, 'B', 5515, 2569, 'A', 9961, 'j', 6009, 'U']
Output:
x, d, i, U, 545, 6681, n, Q, 3085, 1997, 393, 9335, 8387, 8729, 821, 2379