Definition: In this task, you are given two lists A,B. Find the longest common subsequence in the lists A and B.
Input: [5195, 8067, 1683, 'J', 3861, 'R', 2551, 'M', 'c', 'C', 's', 9495, 8553, 'W', 'a', 'c', '9825', 'v', 'a', '2015', '2811', 'J', '9123', 'W', '3237', '2367', 'U', 'D', 'F', '5315', 'E', '3283', '5143', '7653', '2685', 'f', 't', 'N', 'x', 'e', 1627, 4451], ['a', 8943, 6465, 6765, 925, 'W', 281, 'l', 2731, 'y', 'q', 'A', '9825', 'v', 'a', '2015', '2811', 'J', '9123', 'W', '3237', '2367', 'U', 'D', 'F', '5315', 'E', '3283', '5143', '7653', '2685', 'f', 'P', 9395, 5709, 6827, 'X', 'K', 4827, 'M', 4449, 2685, 4273, 9793]
Output:
9825, v, a, 2015, 2811, J, 9123, W, 3237, 2367, U, D, F, 5315, E, 3283, 5143, 7653, 2685, f