Instructions: In this task, you are given two lists A,B. Find the longest common subsequence in the lists A and B.
Input: [4033, 'U', 'H', 'C', 'M', 'r', 'I', 9881, 9565, 6363, 6235, 8203, 31, 2527, '2333', 'C', 't', 'C', 'O', '2299', '9833', 'o', 'x', 'S', 'X', 'g', '9841', '7253', 'E', '6673', 'h', '9425', 'h', '8819', 'X', 'K', 471, 4401, 3659, 'n', 'y', 'J'], ['N', 'q', 'g', 'J', 'T', 3579, 'V', 'e', 'b', 8737, 'u', 3991, 9003, 'X', 'f', 9839, '2333', 'C', 't', 'C', 'O', '2299', '9833', 'o', 'x', 'S', 'X', 'g', '9841', '7253', 'E', '6673', 'h', '9425', 'h', '8819', 'X', 'E', 'm', 4377, 'Z', 25, 2707, 9995, 575, 'm', 2443, 2799, 339, 'y', 4229, 'Y', 2461]
Output:
2333, C, t, C, O, 2299, 9833, o, x, S, X, g, 9841, 7253, E, 6673, h, 9425, h, 8819, X