Definition: In this task, you are given two lists A,B. Find the longest common subsequence in the lists A and B.
Input: ['R', 9217, 'A', 'N', 7517, 'E', 4063, 'E', 'R', 4435, 7153, 'A', 195, 'a', '1399', 'q', '8407', '721', '5313', '7329', 'r', 'I', '433', '9161', 'Y', '2881', '9135', '6341', '2679', 'y', 'r', 'n', 'E', 8485, 'D', 10017, 2239, 'a', 'm', 9663, 'b', 9015, 7477, 2537, 'V', 't', 'v', 'w', 'W', 761], ['v', 'f', 'v', 3487, 6099, 9791, 6347, 7755, 1561, '1399', 'q', '8407', '721', '5313', '7329', 'r', 'I', '433', '9161', 'Y', '2881', '9135', '6341', '2679', 'y', 'r', 'n', 'r', 1707, 8939]
Output:
1399, q, 8407, 721, 5313, 7329, r, I, 433, 9161, Y, 2881, 9135, 6341, 2679, y, r, n