Definition: In this task, you are given two lists A,B. Find the longest common subsequence in the lists A and B.
Input: [1017, 'L', 'T', 'Z', 'H', 6119, 'i', 'O', 'x', 3415, 2397, 6907, 1589, '8933', 'B', '105', 'c', '7905', 'I', '6667', '7169', 'U', 'r', '9783', 'U', 'w', '7361', 'F', 'R', '4691', 'y', '9469', 'R', '2169', 'a', 5675, 9205, 7497, 1355, 'Y', 'C', 'c', 4471, 1175, 'z', 'Y', 'X', 7961, 4687], ['N', 'L', 479, 5655, 1993, 7577, 's', 7261, '8933', 'B', '105', 'c', '7905', 'I', '6667', '7169', 'U', 'r', '9783', 'U', 'w', '7361', 'F', 'R', '4691', 'y', '9469', 'R', '2169', 'I', 'Z', 'a', 3165, 'r', 9797]
Output:
8933, B, 105, c, 7905, I, 6667, 7169, U, r, 9783, U, w, 7361, F, R, 4691, y, 9469, R, 2169