Definition: In this task, you are given two lists A,B. Find the longest common subsequence in the lists A and B.
Input: ['x', 'C', 7573, 'C', 'Z', 'X', '1075', '9055', '7377', '765', '2267', '4845', '9149', 'f', '9081', '1755', '5805', 'u', '7811', 'J', 'G', 'C', '9957', 'X', 'W', '1739', 'H', 'x', '5453', 'a', 9431, 'F', 'E', 't', 'p', 5433, 1625, 'J', 'R', 'c', 'c', 'Z'], ['t', 4473, 9423, 6427, 5533, 'W', 1391, 7045, 3677, 8693, 'C', 'm', 8027, 1661, 3933, 7129, 7517, 7221, 'B', 'X', '1075', '9055', '7377', '765', '2267', '4845', '9149', 'f', '9081', '1755', '5805', 'u', '7811', 'J', 'G', 'C', '9957', 'X', 'W', '1739', 'H', 'x', '5453', 'X', 'E']
Output:
X, 1075, 9055, 7377, 765, 2267, 4845, 9149, f, 9081, 1755, 5805, u, 7811, J, G, C, 9957, X, W, 1739, H, x, 5453