Definition: In this task, you are given two lists A,B. Find the longest common subsequence in the lists A and B.
Input: ['d', 'w', 9103, 'N', 'x', 'o', 367, 'S', 8091, 'c', '1227', '9455', 'Z', '3725', 'D', 'W', 'W', '689', 'R', 'Q', 'n', 789, 'd', 6581, 5183, 'Z', 6107, 5005], ['W', 9307, 6669, 'Y', 4665, 2287, 'c', '1227', '9455', 'Z', '3725', 'D', 'W', 'W', '689', 'R', 'Q', 'v', 'X']
Output:
c, 1227, 9455, Z, 3725, D, W, W, 689, R, Q