Definition: In this task, you are given two lists A,B. Find the longest common subsequence in the lists A and B.
Input: ['L', 4133, 'i', 6361, 9351, 5559, 'A', 'o', 3279, 8873, 'v', 6559, 1243, 1177, 3381, 1609, 'x', '9715', '1971', 'R', '5373', 'V', '8595', 'S', '2451', '885', '7071', 'u', 'B', 'x', 'Q', '6457', '555', 'e', 'c', 'F', '9309', '3299', 'H', 7143, 3699, 'k', 2683, 'd', 8327, 'O', 7243, 'M', 'd', 'i', 'q'], ['A', 8071, 5941, 6627, 6679, 'H', 'q', 'S', 'G', 9049, 'w', 2011, 9271, 6325, 'u', 'Q', 5917, 'd', 'c', '9715', '1971', 'R', '5373', 'V', '8595', 'S', '2451', '885', '7071', 'u', 'B', 'x', 'Q', '6457', '555', 'e', 'c', 'F', '9309', '3299', 'C', 5927, 3799, 'j', 'x', 1349, 8381, 1633, 5571, 's', 'N', 'e', 'L', 'U']
Output:
9715, 1971, R, 5373, V, 8595, S, 2451, 885, 7071, u, B, x, Q, 6457, 555, e, c, F, 9309, 3299