Definition: In this task, you are given two lists A,B. Find the longest common subsequence in the lists A and B.
Input: ['H', 'U', 7297, 'l', 'i', 9243, 'M', 'T', 'T', 'g', 4477, 1953, 'e', 131, 1745, 'd', '697', '7551', 'M', '8741', 'J', '1593', 'e', '6683', '9887', '4353', '6967', 'b', 'o', '5131', '7705', '2777', '9093', 'S', '2969', 'h', '8391', '2901', 'I', 'D', 'y', 'L', 'E', 6207, 'u'], [6573, 'h', 8343, 3805, 'L', 505, 'U', 9531, 5971, 7065, 9561, '697', '7551', 'M', '8741', 'J', '1593', 'e', '6683', '9887', '4353', '6967', 'b', 'o', '5131', '7705', '2777', '9093', 'S', '2969', 'h', '8391', '2901', 'I', 'D', 'y', 'L', 'c', 't', 625, 'C', 'd', 4775, 1371, 'D', 'l']
Output:
697, 7551, M, 8741, J, 1593, e, 6683, 9887, 4353, 6967, b, o, 5131, 7705, 2777, 9093, S, 2969, h, 8391, 2901, I, D, y, L