Definition: In this task, you are given two lists A,B. Find the longest common subsequence in the lists A and B.
Input: [8571, 5455, 'i', 'V', 'C', '4413', 'U', '373', '8055', '4827', '3537', '4281', 'u', '9959', '5589', '1673', 'Q', 'X', 'c', '317', 'o', 'v', 'g', 'j', 'o', '1527', '5175', 'b', 'e', 2467, 'm', 6279, 'r', 4797], [8513, 6301, 7109, 1049, 6295, 'D', 'V', 'L', 7669, 5565, 8465, 'o', 'g', 1613, 4689, 7185, 'k', 10027, 'O', 'C', '4413', 'U', '373', '8055', '4827', '3537', '4281', 'u', '9959', '5589', '1673', 'Q', 'X', 'c', '317', 'o', 'v', 'g', 'j', 'o', '1527', '5175', 'b', 'k', 'x', 2903, 2659, 3525, 'b', 2621, 8567, 'y', 'X', 8269]
Output:
C, 4413, U, 373, 8055, 4827, 3537, 4281, u, 9959, 5589, 1673, Q, X, c, 317, o, v, g, j, o, 1527, 5175, b