In this task, you are given two lists A,B. Find the longest common subsequence in the lists A and B.

Input: Consider Input: [3659, 'D', 'P', 'K', '7241', 'V', 'p', 'i', '6013', 'X', 'C', '8145', 'Y', '2517', 'z', 'y', 6631, 2281, 6607], [3101, 7057, 'N', 7065, 'X', 'r', 'n', 2803, 'G', 'v', '7241', 'V', 'p', 'i', '6013', 'X', 'C', '8145', 'Y', '2517', 'z', 's', 5293, 'F', 1371, 4459, 6983, 'R', 'X']

Output: 7241, V, p, i, 6013, X, C, 8145, Y, 2517, z

Input: Consider Input: [875, 'U', 'g', 'q', 'H', 2847, 'f', '6811', 'B', '7549', 'K', 'r', 'V', 'x', 'P', 'X', '2469', '3845', 'W', 'e', 'n', 5885, 'w', 3345, 4693, 'H', 7789, 'y', 'j', 'e'], ['V', 'j', 6713, 2923, 'y', 6205, 'm', 5961, 9023, '6811', 'B', '7549', 'K', 'r', 'V', 'x', 'P', 'X', '2469', '3845', 'W', 'y', 7427, 5987]

Output: 6811, B, 7549, K, r, V, x, P, X, 2469, 3845, W

Input: Consider Input: [8009, 'i', 'D', 'K', 'L', 'z'], ['A', 'v', 'D', 'K', 'O', 'Y']
Output: D, K