Instructions: In this task, you are given two lists A,B. Find the longest common subsequence in the lists A and B.
Input: ['C', 'O', 'a', 1717, 's', 'M', 361, '83', '583', '3455', 'Z', 'Y', 'Q', '8045', 'g', '6315', 'k', 'j', 'C', 'a', 'k', 'i', 'b', 'n', 'o', '7869', 'u', '9411', 'r', 'Z', 2625, 'a', 'Y'], ['l', 1643, 'S', 'q', 'b', 'w', 5199, 'M', 'F', 5319, 'X', 'K', 1011, 1941, 221, 1223, 2673, 2859, 9225, 293, 1993, 'd', '83', '583', '3455', 'Z', 'Y', 'Q', '8045', 'g', '6315', 'k', 'j', 'C', 'a', 'k', 'i', 'b', 'n', 'o', '7869', 'u', '9411', 'r', 'j', 211, 'b', 'C', 'G', 5175, 1139, 'R', 'j', 'S', 3485, 2829, 'X', 6695, 'L']
Output:
83, 583, 3455, Z, Y, Q, 8045, g, 6315, k, j, C, a, k, i, b, n, o, 7869, u, 9411, r