Definition: In this task, you are given two lists A,B. Find the longest common subsequence in the lists A and B.
Input: ['U', 'd', 'C', 6133, 4571, 'r', '3793', 'Y', 'u', '313', '4709', '1179', '9551', '1205', '9793', 'm', 'g', 'W', 'f', '8101', '1255', 'H', 'M', 'Q', 'f', 'l', 'K', 'g', 'u', 'V', 'h', 683, 'P', 'I', 8773, 1243, 5837, 431, 6885, 5851, 'P', 'k', 5673, 1327], [1815, 8447, 9673, 4039, 'n', 'F', 511, 3071, 'G', 'a', 'W', 'K', 3033, '3793', 'Y', 'u', '313', '4709', '1179', '9551', '1205', '9793', 'm', 'g', 'W', 'f', '8101', '1255', 'H', 'M', 'Q', 'f', 'l', 'K', 'g', 'u', 'p', 'S', 3495, 's', 4335, 'x', 433, 'S', 't', 'i', 8043, 'f', 'M', 'i', 2407, 't', 3, 9297, 2087]
Output:
3793, Y, u, 313, 4709, 1179, 9551, 1205, 9793, m, g, W, f, 8101, 1255, H, M, Q, f, l, K, g, u